A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices
From MaRDI portal
Publication:1062422
DOI10.1016/0024-3795(85)90101-6zbMath0572.65023OpenAlexW2027554429MaRDI QIDQ1062422
Publication date: 1985
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(85)90101-6
Related Items (8)
Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift ⋮ On the convergence rate of the QL algorithm with Wilkinson's shift ⋮ An algorithm for finding generalized eigenpairs of a symmetric definite matrix pencil ⋮ 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 ⋮ Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance ⋮ Convergence of the tridiagonal \(QR\) algorithm ⋮ Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
Cites Work
This page was built for publication: A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices