Computations of eigenpair subsets with the MRRR algorithm

DOI10.1002/NLA.493MaRDI QIDQ3618050zbMATH OpenOpenAlexFDO

Authors O. A. Marques, Beresford N. Parlett, Christof Vömel

Publication date 31 March 2009

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

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

zbMATH Keywords

divide \& conquereigenpairseigenvalue clustersfalse singletoninverse iterationmultiple relatively robust representationsnumerically orthogonal eigenvectorsQR algorithmsubset computationsymmetric tridiagonal matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)

Recommendations

• ScaLAPACK's MRRR algorithm
• Glued Matrices and the MRRR Algorithm
• Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
• Improved accuracy and parallelism for MRRR-based eigensolvers -- a mixed precision approach
• The design and implementation of the MRRR algorithm

Cites work

• Fernando's solution to Wilkinson's problem: An application of double factorization
• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• scientific article; zbMATH DE number 780780 (Why is no real title available?)
• LAPACK Users' Guide

Cited in

(6)

• Improved accuracy and parallelism for MRRR-based eigensolvers -- a mixed precision approach
• Localization in matrix computations: theory and applications
• ScaLAPACK's MRRR algorithm
• The design and implementation of the MRRR algorithm
• Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
• Glued Matrices and the MRRR Algorithm

Describes a project that uses

Uses Software

• LAPACK
• ScaLAPACK
• STEGR

This page was built for publication: Computations of eigenpair subsets with the MRRR algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618050)