A New Proof of Global Convergence for the Tridiagonal QL Algorithm

DOI10.1137/0715060MaRDI QIDQ4187236zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Eigenpairs of MatricesGlobal ConvergenceQl AlgorithmWilkinson's Shift

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited in

(11)

• A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices
• On the convergence rate of the QL algorithm with Wilkinson's shift
• Eigenvalue computation in the 20th century
• Convergence of the tridiagonal QR algorithm
• Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
• An extended QR-solver for large profiled matrices
• A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
• A note on the convergence theorem of the tridiagonal QR algorithm with Wilkinson's shift
• Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
• Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shifts
• Global convergence of Hessenberg shifted QR. I: Exact arithmetic

This page was built for publication: A New Proof of Global Convergence for the Tridiagonal $QL$ Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187236)