Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shifts

DOI10.1016/J.CRMA.2011.10.026MaRDI QIDQ654558zbMATHOpenAlexFDO

Authors Michel Cuer

Publication date 28 December 2011

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.crma.2011.10.026

Mathematics Subject Classification ID

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

Recommendations

• Convergence of the tridiagonal \(QR\) algorithm
• A note on the convergence theorem of the tridiagonal QR algorithm with Wilkinson's shift
• scientific article; zbMATH DE number 822134
• The asymptotics of Wilkinson's shift: Loss of cubic convergence
• On the convergence rate of the QL algorithm with Wilkinson's shift

Cites work

• scientific article; zbMATH DE number 1049347 (Why is no real title available?)
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• A New Proof of Global Convergence for the Tridiagonal $QL$ Algorithm
• A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices
• Convergence of the QR algorithm
• Correction to convergence of the QR algorithm
• Global convergence of tridiagonal QR algorithm with origin shifts
• Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
• Matrix algorithms. Vol. 2: Eigensystems
• On the convergence of the \(QR\) algorithm with multishifts
• The QR Algorithm Revisited

This page was built for publication: Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shifts

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