Implicit Shifting in the QR and Related Algorithms
DOI10.1137/0612028zbMATH Open0725.65040OpenAlexW2036548820MaRDI QIDQ5203568FDOQ5203568
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
Recommendations
Hessenberg matrixpole placementQR algorithmmatrix eigenproblemimplicit shiftimplicit shiftingexplicit and implicit shift algorithms
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Pole and zero placement problems (93B55)
Cited In (11)
- Chasing bulges or rotations? A metamorphosis of the QR-algorithm
- The QR Algorithm Revisited
- A multishift QR iteration without computation of the shifts
- Shifting algorithms with Maple and implicit shift in the QR algorithm
- Implicit QR with compression
- Gaussian quadrature for matrix valued functions on the real line
- Title not available (Why is that?)
- Title not available (Why is that?)
- The transmission of shifts and shift blurring in the QR algorithm
- Block Krylov-Schur method for large symmetric eigenvalue problems
- The \(QR\) steps with perfect shifts
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)