Convergence of the tridiagonal \(QR\) algorithm
From MaRDI portal
Publication:1595112
DOI10.1016/S0024-3795(00)00171-3zbMath0967.65047MaRDI QIDQ1595112
Publication date: 31 January 2001
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (2)
Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift ⋮ A note on the convergence theorem of the tridiagonal QR algorithm with Wilkinson's shift
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices
- The QR algorithm for unitary Hessenberg matrices
- On the convergence rate of the QL algorithm with Wilkinson's shift
- The shifted QR algorithm for Hermitian matrices
- Global convergence of tridiagonal QR algorithm with origin shifts
- Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
- The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices
- A New Proof of Global Convergence for the Tridiagonal $QL$ Algorithm
This page was built for publication: Convergence of the tridiagonal \(QR\) algorithm