Volume 7, pp. 104-123, 1998.

Preconditioned eigensolvers - an oxymoron?

Andrew V. Knyazev

Abstract

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.

Full Text (PDF) [3 MB]

Key words

eigenvalue, eigenvector, iterative methods, preconditioner, eigensolver, conjugate gradient, Davidson's method, domain decomposition.

AMS subject classifications

65F15, 65F50, 65N25.

ETNA articles which cite this article

Vol. 15 (2003), pp. 38-55 Andrew V. Knyazev and Klaus Neymeyr: Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
Vol. 41 (2014), pp. 93-108 Klaus Neymeyr and Ming Zhou: The block preconditioned steepest descent iteration for elliptic operator eigenvalue problems
Vol. 42 (2014), pp. 197-221 Qiao Liang and Qiang Ye: Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
Vol. 46 (2017), pp. 424-446 Ming Zhou and Klaus Neymeyr: Sharp Ritz value estimates for restarted Krylov subspace iterations

< Back