Convergence of the tridiagonal \(QR\) algorithm
type: Item
instance of: scholarly article
title: Convergence of the tridiagonal \(QR\) algorithm
zbMATH Open document ID: 0967.65047
DOI: 10.1016/S0024-3795(00)00171-3
author: Tai-Lin Wang
published in: Linear Algebra and its Applications
publication date: 2001-01-31T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 1559338
zbMATH Keywords: tridiagonal matrices
zbMATH Keywords: global convergence
zbMATH Keywords: \(QR\) algorithm
zbMATH Keywords: shift strategy
reviewed by: F. Szidarovszky
MaRDI profile type: Publication
cites work: The shifted QR algorithm for Hermitian matrices
cites work: The QR algorithm for unitary Hessenberg matrices
cites work: A New Proof of Global Convergence for the Tridiagonal $QL$ Algorithm
cites work: Q3719719
cites work: A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices
cites work: The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices
cites work: Q4348515
cites work: Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
cites work: Q5674306
cites work: Global convergence of tridiagonal QR algorithm with origin shifts
cites work: On the convergence rate of the QL algorithm with Wilkinson's shift
description: scientific article; zbMATH DE number 1559338