On the convergence of the QR algorithm with multishifts

DOI10.1007/BF02355377zbMATH Open0899.65014MaRDI QIDQ1376930FDOQ1376930

Authors: E. E. Tyrtyshnikov 

Publication date: 1 June 1998

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesQR algorithm with multishiftquadratic and cubic convergence

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On some algorithms for the solution of the complete eigenvalue problem
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• Convergence of algorithms of decomposition type for the eigenvalue problem
• ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION
• Title not available (Why is that?)
• Shifting Strategies for the Parallel $QR$ Algorithm
• Title not available (Why is that?)
• The calculation of Lame polynomials

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shifts
• On the convergence rate of the QL algorithm with Wilkinson's shift

This page was built for publication: On the convergence of the \(QR\) algorithm with multishifts

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