Glued Matrices and the MRRR Algorithm

DOI10.1137/040620746zbMath1092.65028OpenAlexW2019515337MaRDI QIDQ5470328

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

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

symmetric tridiagonal matrixmultiple relatively robust representationsnumerically orthogonal eigenvectorsglued matricestight clusters of eigenvaluesWilkinson matrices

Mathematics Subject Classification ID

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

Related Items (2)

On a special basis of approximate eigenvectors with local supports for an isolated narrow cluster of eigenvalues of a symmetric tridiagonal matrix ⋮ Rapid filtration algorithm to construct a minimal basis on the fly from a primitive Gaussian basis

Uses Software

• LAPACK
• STEGR

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