Implicit Shifting in the QR and Related Algorithms

DOI10.1137/0612028MaRDI QIDQ5203568zbMATH OpenOpenAlexFDO

Authors George Miminis, Christopher C. Paige

Publication date 1991

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

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

zbMATH Keywords

explicit and implicit shift algorithmsHessenberg matriximplicit shiftimplicit shiftingmatrix eigenproblempole placementQR algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Pole and zero placement problems (93B55)

Recommendations

• scientific article; zbMATH DE number 4001318
• Shifting algorithms with Maple and implicit shift in the QR algorithm
• A generalization of the multishift QR algorithm
• Implicit QR with compression
• A multishift QR iteration without computation of the shifts

Cited in

(12)

• A multishift QR iteration without computation of the shifts
• Shifting algorithms with Maple and implicit shift in the QR algorithm
• Gaussian quadrature for matrix valued functions on the real line
• The transmission of shifts and shift blurring in the QR algorithm
• Chasing bulges or rotations? A metamorphosis of the QR-algorithm
• scientific article; zbMATH DE number 741158 (Why is no real title available?)
• The QR steps with perfect shifts
• scientific article; zbMATH DE number 4001318 (Why is no real title available?)
• The QR Algorithm Revisited
• Randomized implicitly restarted Arnoldi method for the non-symmetric eigenvalue problem
• Implicit QR with compression
• Block Krylov-Schur method for large symmetric eigenvalue problems

This page was built for publication: Implicit Shifting in the QR and Related Algorithms

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