Performance and Accuracy of LAPACK's Symmetric TridiagonalEigensolvers
We compare four algorithms from the latest LAPACK 3.1 release for computing eigenpairs of a symmetric tridiagonal matrix. These include QR iteration, bisection and inverse iteration (BI), the Divide-and-Conquer method (DC), and the method of Multiple Relatively Robust Representations (MR). Our evaluation considers speed and accuracy when computing all eigenpairs, and additionally subset computations. Using a variety of carefully selected test problems, our study includes a variety of today's computer architectures. Our conclusions can be summarized as follows. (1) DC and MR are generally much faster than QR and BI on large matrices. (2) MR almost always does the fewest floating point operations, but at a lower MFlop rate than all the other algorithms. (3) The exact performance of MR and DC strongly depends on the matrix at hand. (4) DC and QR are the most accurate algorithms with observed accuracy O({radical}ne). The accuracy of BI and MR is generally O(ne). (5) MR is preferable to BI for subset computations.
- Research Organization:
- COLLABORATION - UCBerkeley
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 928868
- Report Number(s):
- LBNL-62584; SJOCE3; R&D Project: KC6636; BnR: 830404000; TRN: US200811%%360
- Journal Information:
- SIAM Journal on Scientific Computing, Vol. 30, Issue 3; Related Information: Journal Publication Date: 04/2008; ISSN 1064-8275
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures
Parallel solution of the symmetric tridiagonal eigenproblem. Research report