An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank Matrices

DOI10.1137/090754522zbMath1216.65045OpenAlexW2008652629MaRDI QIDQ2998029

Gianna M. Del Corso, Raf Vandebril

Publication date: 17 May 2011

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

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

zbMATH Keywords

numerical experimentsimplicit methodHessenberg matrix\(QR\)-algorithmmultishiftGivens-weight representationHermitian plus low rank matrices

Mathematics Subject Classification ID

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

Related Items (10)

Unnamed Item ⋮ A condensed representation of almost normal matrices ⋮ A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence ⋮ Block tridiagonal reduction of perturbed normal and rank structured matrices ⋮ Fast computation of eigenvalues of companion, comrade, and related matrices ⋮ Fast QR iterations for unitary plus low rank matrices ⋮ A CMV-Based Eigensolver for Companion Matrices ⋮ Rank-Structured QR for Chebyshev Rootfinding ⋮ Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems ⋮ Fast and Backward Stable Computation of Roots of Polynomials

This page was built for publication: An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank Matrices