Iterative eigenvalue algorithms based on convergent splittings

Abstract

Application of direct iterations, based on convergent splittings, to the eigenvalue problem of large sparse symmetric matrices is discussed. A general convergence proof is given, and it is shown how parameters should be chosen to give the best rate of convergence. As special examples are considered, SOR iteration and iteration based on the use of a fast direct Poisson solver. Numerical tests are reported.