Bidirectional Chasing Algorithms for the Eigenvalue Problem

DOI10.1137/0614015MaRDI QIDQ4033825zbMATH OpenOpenAlexFDO

Authors David S. Watkins

Publication date 16 May 1993

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

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

zbMATH Keywords

\(GR\) algorithm\(QR\) algorithmbidirectional chasing algorithmschasing the bulgecomplex matriceseigenvalueHamiltonian matrixsingle-shift Hamiltonian \(QR\) algorithm

Mathematics Subject Classification ID

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

Recommendations

• Chasing Algorithms for the Eigenvalue Problem
• Structured QR algorithms for Hamiltonian symmetric matrices
• Core-Chasing Algorithms for the Eigenvalue Problem
• The QR Algorithm Revisited
• An extended Hamiltonian QR algorithm

Cited in

(5)

• A class of Hamiltonian-symplectic methods for solving the algebraic Riccati equation
• An extended Hamiltonian QR algorithm
• Chasing Algorithms for the Eigenvalue Problem
• Core-Chasing Algorithms for the Eigenvalue Problem
• Rational QR-iteration without inversion

This page was built for publication: Bidirectional Chasing Algorithms for the Eigenvalue Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033825)