A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence (Q432772)
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 6053113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence |
scientific article; zbMATH DE number 6053113 |
Statements
A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence (English)
0 references
4 July 2012
0 references
The authors are concerned with the analysis of the global convergence property of a Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems. Their algorithm reduces to the standard Wilkinson shift in the single shift case.
0 references
symmetric tridiagonal matrix
0 references
global convergence
0 references
Wilkinson-like multishift QR algorithm
0 references
symmetric eigenvalue problem
0 references
0 references
0 references
0.8118179440498352
0 references
0.8113824725151062
0 references
0.796299934387207
0 references
0.7946009039878845
0 references
