Glued Matrices and the MRRR Algorithm

DOI10.1137/040620746MaRDI QIDQ5470328zbMATH OpenOpenAlexFDO

Authors Inderjit S. Dhillon, Beresford N. Parlett, Christof Vömel

Publication date 30 May 2006

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

Full work available at URL https://doi.org/10.1137/040620746

zbMATH Keywords

glued matricesmultiple relatively robust representationsnumerically orthogonal eigenvectorssymmetric tridiagonal matrixtight clusters of eigenvaluesWilkinson matrices

Mathematics Subject Classification ID

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

Recommendations

• ScaLAPACK's MRRR algorithm
• Computations of eigenpair subsets with the MRRR algorithm
• The design and implementation of the MRRR algorithm
• Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
• A framework for the \(\text{MR}^3\) algorithm: theory and implementation

Cited in

(8)

• Glued trees algorithm under phase damping
• Improved accuracy and parallelism for MRRR-based eigensolvers -- a mixed precision approach
• ScaLAPACK's MRRR algorithm
• The design and implementation of the MRRR algorithm
• Computations of eigenpair subsets with the MRRR algorithm
• Rapid filtration algorithm to construct a minimal basis on the fly from a primitive Gaussian basis
• On a special basis of approximate eigenvectors with local supports for an isolated narrow cluster of eigenvalues of a symmetric tridiagonal matrix
• Estimation of spectral gaps for sparse symmetric matrices

Describes a project that uses

Uses Software

• LAPACK
• STEGR

This page was built for publication: Glued Matrices and the MRRR Algorithm

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