QR-Like Algorithms for Symmetric Arrow Matrices
- 1 April 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 13 (2) , 655-658
- https://doi.org/10.1137/0613039
Abstract
It is shown that no QR-like algorithm exists for symmetric arrow matrices, i.e., for matrices whose elements vanish, except those on the diagonal and in the first row and column.Keywords
This publication has 6 references indexed in Scilit:
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matricesJournal of Computational Physics, 1990
- The use of a refined error bound when updating eigenvalues of tridiagonalsLinear Algebra and its Applications, 1985
- The numerically stable reconstruction of Jacobi matrices from spectral dataNumerische Mathematik, 1984
- A divide and conquer method for the symmetric tridiagonal eigenproblemNumerische Mathematik, 1980
- Some Modified Matrix Eigenvalue ProblemsSIAM Review, 1973
- Algebra IPublished by Springer Nature ,1971