On the convergence rate of the QL algorithm with Wilkinson's shift
From MaRDI portal
Publication:1111335
DOI10.1016/0024-3795(89)90292-9zbMath0658.65039OpenAlexW2093736832WikidataQ127493871 ScholiaQ127493871MaRDI QIDQ1111335
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90292-9
Related Items (3)
On the convergence rate of the QL algorithm with Wilkinson's shift ⋮ A note on the convergence theorem of the tridiagonal QR algorithm with Wilkinson's shift ⋮ Convergence of the tridiagonal \(QR\) algorithm
Cites Work
- Unnamed Item
- A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices
- On the convergence rate of the QL algorithm with Wilkinson's shift
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A New Proof of Global Convergence for the Tridiagonal $QL$ Algorithm
This page was built for publication: On the convergence rate of the QL algorithm with Wilkinson's shift