Convergence of the tridiagonal \(QR\) algorithm (Q1595112)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1559338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of the tridiagonal \(QR\) algorithm |
scientific article; zbMATH DE number 1559338 |
Statements
Convergence of the tridiagonal \(QR\) algorithm (English)
0 references
31 January 2001
0 references
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.
0 references
tridiagonal matrices
0 references
global convergence
0 references
\(QR\) algorithm
0 references
shift strategy
0 references
0.8998818397521973
0 references
0.8870227932929993
0 references
0.8670098185539246
0 references
