Robust preconditioning of large, sparse, symmetric eigenvalue problems (Q1917916): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: EISPACK / rank | |||
Normal rank | |||
Revision as of 07:47, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robust preconditioning of large, sparse, symmetric eigenvalue problems |
scientific article |
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
