Preconditioning eigenvalues and some comparison of solvers (Q1591177): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: JDQR / rank | |||
Normal rank |
Revision as of 12:16, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Preconditioning eigenvalues and some comparison of solvers |
scientific article |
Statements
Preconditioning eigenvalues and some comparison of solvers (English)
0 references
10 February 2002
0 references
This is nice summary of preconditioning techniques for eigenvalue problems \(Ax=\lambda x\), including Davidson, Jacobs-Davidson, Rayleigh quotient iteration and preconditioned Lanczos methods. It is shown that these preconditioning methods are related by the same preconditioned operator \(M^{-1}(A-\theta I)\). Here \(\theta\) is an approximate eigenvalue and \(M\) is an approximation of \(A-\theta I\). Hence, the convergence rates of preconditioning methods are often similar. However, proper implementation can make a difference. This is, in addition to the comparisons of these methods, illustrated by numerical examples.
0 references
eigenvalue problems
0 references
preconditioning
0 references
Davidson methods
0 references
Rayleigh quotient iteration
0 references
convergence
0 references
comparisons
0 references
numerical examples
0 references