Sharp Convergence Estimates for the Preconditioned Steepest Descent Method for Hermitian Eigenvalue Problems
Evgueni Ovtchinnikov · SIAM Journal on Numerical Analysis · 2006
The paper is concerned with convergence estimates for the preconditioned steepest descent method for the computation of the smallest eigenvalue of a Hermitian operator. Available estimates are reviewed and new estimates are introduced that improve on the known ones in certain respects. In addition to the estimates for the error reduction after one iteration, we consider estimates for the so-called asymptotic convergence factor defined as the upper limit of the average error reduction per iteration. The paper focuses on sharp estimates, i.e., those that cannot be improved without using additional information.