Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method (Q1279554)
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: Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method |
scientific article; zbMATH DE number 1249454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method |
scientific article; zbMATH DE number 1249454 |
Statements
Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method (English)
0 references
8 February 1999
0 references
Restarting for the Jacobi-Davidson method, a preconditioned extension to the Arnoldi method, to solve large sparse symmetric eigenvalue problems is considered. Often convergence deterioration may occur. The Davidson method and its restarting scheme are described, and the behaviour of this scheme after preconditioning is examined. Murray's conjugate gradient -- restarting scheme and its potential benefits are shown. Its combination with thick restarting is proposed. Numerical experiments demonstrate the effectiveness of this combination.
0 references
implicit restarting
0 references
deflation
0 references
preconditioning
0 references
eigenvectors
0 references
conjugate gradient method
0 references
Lanczos method
0 references
numerical experiments
0 references
Jacobi-Davidson method
0 references
Arnoldi method
0 references
large sparse symmetric eigenvalue problems
0 references
convergence
0 references
0.8656367063522339
0 references
0.8498132228851318
0 references
0.8348039388656616
0 references
0.8250896334648132
0 references
