Practical improvement of the divide-and-conquer eigenvalue algorithms (Q1192014)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Practical improvement of the divide-and-conquer eigenvalue algorithms |
scientific article |
Statements
Practical improvement of the divide-and-conquer eigenvalue algorithms (English)
0 references
27 September 1992
0 references
A practical modification of the well known divide-and-conquer algorithms for approximating the eigenvalues of a real symmetric tridiagonal matrix is presented. In this modification version the authors avoid the numerical stability problems of the algorithm but preserve the insensivity to clustering the eigenvalue and possibility to give upper bounds on the computational cost for any input matrix. Theoretical effectiveness of the algorithms is confirmed by numerical experiments.
0 references
divide-and-conquer algorithms
0 references
eigenvalues
0 references
symmetric tridiagonal matrix
0 references
numerical stability
0 references
clustering
0 references
computational cost
0 references
effectiveness
0 references
numerical experiments
0 references