
We give a formal definition of preconditioned eigensolvers as polynomial methods. We present a survey of some theoretical convergence rate estimates for preconditioned iterative methods for symmetric eigenvalue problems. We consider preconditioned analogs of the power method, the steepest descent/ascent method, the Lanczos-type methods by Scott and Davidson, the conjugate gradient methods, as well as their block variants. We discuss possible approaches for deriving formulas of the methods and conclude that different approaches lead to the same methods.
The talk is based on the paper:
"Preconditioned eigensolvers - an oxymoron?"
, ETNA,
7 (1998), pp. 104-123.