Robust preconditioning of large, sparse, symmetric eigenvalue problems (Q1917916)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Robust preconditioning of large, sparse, symmetric eigenvalue problems |
scientific article; zbMATH DE number 903549
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robust preconditioning of large, sparse, symmetric eigenvalue problems |
scientific article; zbMATH DE number 903549 |
Statements
Robust preconditioning of large, sparse, symmetric eigenvalue problems (English)
0 references
20 February 1997
0 references
The generalized Davidson method is a technique for eigenvalue preconditioning in the computation of a few selected eigenvalues of large, sparse, symmetric matrices. In the paper, the quality of preconditioning is studied and strategies are proposed to improve the robustness. The authors present extensive and quite convincing numerical evidence.
0 references
numerical examples
0 references
Davidson method
0 references
eigenvalue preconditioning
0 references
large, sparse, symmetric matrices
0 references
0 references
0 references
0 references
0 references
0.9383569
0 references
0.93452156
0 references
0.9197713
0 references
0.9144925
0 references
0.91035366
0 references
0.9091204
0 references
0.9077301
0 references
