Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach (Q1077870)
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 3958567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach |
scientific article; zbMATH DE number 3958567 |
Statements
Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach (English)
0 references
1986
0 references
For the solution of symmetric tridiagonal eigenvalue problems, a divide- and-conquer approach is presented, that is based on a sequential doubling in the evaluation of the characteristic polynomial and a bisection method. The high accuracy of the method is demonstrated by examples. It would have been very interesting to see a comparison of the method with the algorithm of Cuppen for example in its implementation by Dongarra/Sørensen.
0 references
tree algorithms
0 references
recursive doubling
0 references
symmetric tridiagonal eigenvalue problems
0 references
divide-and-conquer
0 references
bisection method
0 references
0.8682289123535156
0 references
0.8574346303939819
0 references
0.8574346303939819
0 references
0.8557285666465759
0 references
