Convergence of the tridiagonal QR algorithm

From MaRDI portal
Convergence of the tridiagonal \(QR\) algorithm





An elementary and constructive proof is given for the global convergence of the symmetric tridiagonal \(QR\) algorithm with Wilkinson's shift. It is also shown that the asymptotic convergence rate is essentially cubic, as has long been observed in numerical experiments. A general mixed shift strategy is also presented with global convergence and cubic rate.











This page was built for publication: Convergence of the tridiagonal \(QR\) algorithm

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