QR-Like Algorithms for Symmetric Arrow Matrices

DOI10.1137/0613039zbMath0752.65029OpenAlexW2023663671MaRDI QIDQ4005094

Gene H. Golub, Peter Arbenz

Publication date: 27 September 1992

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

eigenvaluespectral decompositionsymmetric matricesQR algorithmHouseholder transformationsarrow matrixGivens transformationbordered diagonal matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

An approximate inverse matrix technique for arrowhead matrices, On computing accurate singular values and eigenvalues of matrices with acyclic graphs, A graph-theoretic model of symmetric Givens operations and its implications, The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices, Implicit QR for rank-structured matrix pencils, Computable eigenvalue bounds for rank-\(k\) perturbations, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems, An efficient method for computing the inverse of arrowhead matrices