Preconditioning eigensolvers -- an Oxymoron?
Electronic transactions on numerical analysis, Tome 7 (1998), pp. 104-123
A short survey of some results on preconditioned iterative methods for symmetric eigenvalue problems is presented. The survey is by no means complete and reflects the author's personal interests and biases, with emphasis on author's own contributions. The author surveys most of the important theoretical results and ideas which have appeared in the Soviet literature, adding references to work published in the western literature mainly to preserve the integrity of the topic. The aim of this paper is to introduce a systematic classification of preconditioned eigensolvers, separating the choice of a preconditioner from the choice of an iterative method. A formal definition of a preconditioned eigensolver is given. Recent developments in the area are mainly ignored, in particular, on Davidson's method. Domain decomposition methods for eigenproblems are included in the framework of preconditioned eigensolvers.
Classification :
65F15, 65F50, 65N25
Keywords: eigenvalue, eigenvector, iterative methods, preconditioner, eigensolver, conjugate gradient, davidson's method, domain decomposition
Keywords: eigenvalue, eigenvector, iterative methods, preconditioner, eigensolver, conjugate gradient, davidson's method, domain decomposition
@article{ETNA_1998__7__a6,
author = {Knyazev, Andrew V.},
title = {Preconditioning eigensolvers -- an {Oxymoron?}},
journal = {Electronic transactions on numerical analysis},
pages = {104--123},
year = {1998},
volume = {7},
zbl = {1053.65513},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ETNA_1998__7__a6/}
}
Knyazev, Andrew V. Preconditioning eigensolvers -- an Oxymoron?. Electronic transactions on numerical analysis, Tome 7 (1998), pp. 104-123. http://geodesic.mathdoc.fr/item/ETNA_1998__7__a6/