A Generalization of the Multishift QR Algorithm
From MaRDI portal
Publication:4902920
DOI10.1137/11085219XzbMath1261.65039OpenAlexW2111145501MaRDI QIDQ4902920
David S. Watkins, Raf Vandebril
Publication date: 18 January 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/11085219x
convergenceeigenvaluesnumerical experimentsQR algorithmCMV matricesrational Krylov methodsubspace iteration
Related Items (8)
An implicit filter for rational Krylov using core transformations ⋮ An extended Hamiltonian QR algorithm ⋮ An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation ⋮ Short recurrences for computing extended Krylov bases for Hermitian and unitary matrices ⋮ Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices ⋮ A Rational QZ Method ⋮ A Core-Chasing Symplectic QR Algorithm ⋮ Generalized Rational Krylov Decompositions with an Application to Rational Approximation
Uses Software
This page was built for publication: A Generalization of the Multishift QR Algorithm
