Go to main content

PDF

Description

In this paper, we propose an algorithm for finding eigenvalues of symmetric tridiagonal matrices based on Laguerre's iteration. The algorithm is fully parallelizable and has been parallelized on CM5 at University of California at Berkeley. We've achieved best possible speedup when matrix dimension is large enough. Besides, we have a well-written serial code which works much more efficient in pathologically close eigenvalue cases than an existing serial code of the same kind due to Li and Zeng.

Details

Title
An Efficient Tridiagonal Eigenvalue Solver on CM 5 with Laguerre's Iteration
Creator
Computer Science Division, Publisher
Ren, Huan, Author
Li, Ren-Cang, Author
Published
1994-12-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-94-848
Type
Text
Format
technical reports
Extent
27 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
Collection

Files

Statistics

from
to
Export
Download Full History
Download
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS
Add to Basket