No label defined (Q3828951)
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 4104253
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4104253 |
Statements
1989
0 references
NEWQL algorithm
0 references
RATQR algorithm
0 references
comparison of methods
0 references
numerical examples
0 references
eigenvalues
0 references
tridiagonal matrix
0 references
0.8540347814559937
0 references
0.8511379957199097
0 references
0.8416109085083008
0 references
[For the entire collection see Zbl 0659.00015.] The method for calculating the k smallest eigenvalues of a tridiagonal matrix is presented. It takes only 30-40 \% of the computing time of RATQR containing in the EISPACK library. A lot of computed examples show that this method is also much more stable than RATQR. Furthermore the new algorithm is stable to find the eigenvalue not only at the beginning of the diagonal of the tridiagonal matrix but also in its middle.
0 references