A multishift QR iteration without computation of the shifts
From MaRDI portal
Publication:1334239
DOI10.1007/BF02140681zbMath0811.65029MaRDI QIDQ1334239
Gene H. Golub, Augustin A. Dubrulle
Publication date: 2 May 1995
Published in: Numerical Algorithms (Search for Journal in Brave)
convergence; eigenvalues; characteristic polynomial; generalized eigenproblem; QR algorithm; Hessenberg matrix; shift vector; multishift QR iteration
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
Numerical solution of linear eigenvalue problems, Rational \(QR\)-iteration without inversion, Hyman's method revisited, Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling, A QR algorithm with variable iteration multiplicity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of algorithms of decomposition type for the eigenvalue problem
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION
- Laguerre's Method Applied to the Matrix Eigenvalue Problem
- An Algorithm for Generalized Matrix Eigenvalue Problems