A New Proof of Global Convergence for the Tridiagonal $QL$ Algorithm
From MaRDI portal
Publication:4187236
DOI10.1137/0715060zbMath0402.65019OpenAlexW2569489637MaRDI QIDQ4187236
Beresford N. Parlett, Walter Hoffmann
Publication date: 1978
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0715060
Related Items
On the convergence rate of the QL algorithm with Wilkinson's shift, Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time, A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence, Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shifts, A note on the convergence theorem of the tridiagonal QR algorithm with Wilkinson's shift, An extended QR-solver for large profiled matrices, Eigenvalue computation in the 20th century, Convergence of the tridiagonal \(QR\) algorithm, A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices, Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
