A multishift QR iteration without computation of the shifts
From MaRDI portal
Publication:1334239
DOI10.1007/BF02140681zbMATH Open0811.65029MaRDI QIDQ1334239FDOQ1334239
Authors: A. A. Dubrulle, Gene H. Golub
Publication date: 2 May 1995
Published in: Numerical Algorithms (Search for Journal in Brave)
Recommendations
- ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION
- Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem
- Implicit Shifting in the QR and Related Algorithms
- The QR Algorithm Revisited
- The transmission of shifts and shift blurring in the QR algorithm
- A note on the double-shift \(QL\) algorithm
- Fast and stable unitary QR algorithm
- scientific article; zbMATH DE number 1097561
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- The periodic QR algorithm is a disguised QR algorithm
convergenceeigenvaluescharacteristic polynomialHessenberg matrixgeneralized eigenproblemQR algorithmshift vectormultishift QR iteration
Cites Work
- Title not available (Why is that?)
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for Generalized Matrix Eigenvalue Problems
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Convergence of algorithms of decomposition type for the eigenvalue problem
- ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION
- Laguerre's Method Applied to the Matrix Eigenvalue Problem
- Title not available (Why is that?)
Cited In (20)
- A generalization of the multishift QR algorithm
- Deferred Shifting Schemes for Parallel QR Methods
- Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
- Shifting algorithms with Maple and implicit shift in the QR algorithm
- Rational \(QR\)-iteration without inversion
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem
- Numerical solution of linear eigenvalue problems
- Origin-shifted algorithm for matrix eigenvalues
- A quadratically convergent QR-like method without shifts for the Hermitian eigenvalue problem
- The convergence of multi-shift QR algorithm for symmetric matrices
- On swapping diagonal blocks in real Schur form
- Title not available (Why is that?)
- The multishift QR algorithm. I: Maintaining well-focused shifts and level 3 performance
- The multishift QR algorithm. II: Aggressive early deflation
- Hyman's method revisited
- Numerical Analysis and Its Applications
- The \(QR\) steps with perfect shifts
- A QR algorithm with variable iteration multiplicity
Uses Software
This page was built for publication: A multishift QR iteration without computation of the shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334239)