A fast and stable parallel QR algorithm for symmetric tridiagonal matrices (Q1893081)
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 769019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast and stable parallel QR algorithm for symmetric tridiagonal matrices |
scientific article; zbMATH DE number 769019 |
Statements
A fast and stable parallel QR algorithm for symmetric tridiagonal matrices (English)
0 references
3 July 1995
0 references
A parallel algorithm based on a divide and conquer method is proposed for computing a few eigenvalues of a symmetric tridiagonal matrix. No common memory is assumed. The authors discuss the numerical stability properties of their algorithm and provide numerical examples.
0 references
QR algorithm
0 references
parallel algorithm
0 references
divide and conquer method
0 references
eigenvalues
0 references
symmetric tridiagonal matrix
0 references
numerical stability
0 references
numerical examples
0 references
0 references
0.9018238186836244
0 references
0.867681086063385
0 references
