Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers

DOI10.1137/070688778zbMath1165.65014OpenAlexW2037798332MaRDI QIDQ3630382

Beresford N. Parlett, Christof Vömel, Osni A. Marques, James W. Demmel

Publication date: 28 May 2009

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc897405/

zbMATH Keywords

performancealgorithmnumerical examplesaccuracytridiagonal matrixinverse iterationbenchmarksymmetric eigenvalue problemQR algorithmbisectiondivide and conquerLAPACKmultiple relatively robust representations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Complexity and performance of numerical algorithms (65Y20)

Related Items

A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem, Higher-order spectral clustering for geometric graphs, An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem, Performance and accuracy of the basic closure algorithm of quadrature-based moment methods, New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem, Coupling bounds for approximating birth-death processes by truncation, Fast Computation of Spectral Projectors of Banded Matrices, Projection methods for quantum channel construction, On tridiagonal matrices unitarily equivalent to normal matrices, Linear algebra software for large-scale accelerated multicore computing, A note on generating finer‐grain parallelism in a representation tree, Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance, Communication lower bounds and optimal algorithms for numerical linear algebra, Performance-Based Numerical Solver Selection in the Lighthouse Framework, Preconditioners for Saddle Point Systems with Trace Constraints Coupling 2D and 1D Domains, Computing the Bidiagonal SVD Through an Associated Tridiagonal Eigenproblem

Uses Software

• LAPACK
• BLAS
• JDQR
• SparseMatrix
• NWChem
• JDQZ