An orthogonal accelerated deflation technique for large symmetric eigenproblems (Q1192738)
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: An orthogonal accelerated deflation technique for large symmetric eigenproblems |
scientific article; zbMATH DE number 61389
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An orthogonal accelerated deflation technique for large symmetric eigenproblems |
scientific article; zbMATH DE number 61389 |
Statements
An orthogonal accelerated deflation technique for large symmetric eigenproblems (English)
0 references
27 September 1992
0 references
Eigenvalue algorithms for large sparse symmetric generalized matrix eigenvalue problems based on conjugate gradient minimization of the Rayleigh quotient with incomplete Chebyshev preconditioning are discussed. It is shown on a numerical example that it is faster to use successive deflation than simultaneous iteration, when several of the smallest eigenvalues are sought, (at least when these are simple).
0 references
conjugate gradient iterations
0 references
Eigenvalue algorithms
0 references
large sparse symmetric generalized matrix eigenvalue problems
0 references
conjugate gradient minimization
0 references
Rayleigh quotient
0 references
incomplete Chebyshev preconditioning
0 references
numerical example
0 references
successive deflation
0 references
simultaneous iteration
0 references
0 references
0 references
