On the convergence rate of a preconditioned subspace eigensolver
In this paper we present a proof of convergence for a preconditioned subspace method which shows the dependency of the convergence rate on the preconditioner used. This convergence rate depends only on the condition of the pre-conditioned system kappa(2)(MA) and the relative separation of the first two eigenvalues 1 - lambda(1)/lambda(2) This means that, for example, multigrid preconditioners can be used to find eigenvalues of elliptic PDE's at a grid-independent rate.
convergence rate eigenvalue problems generalized davidson