Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach (Q1077870): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach |
scientific article |
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
