Volume 15, pp. 38-55, 2003.

Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method

Andrew V. Knyazev and Klaus Neymeyr

Abstract

We present a short survey of multigrid–based solvers for symmetric eigenvalue problems. We concentrate our attention on “off the shelf” and “black box” methods, which should allow solving eigenvalue problems with minimal, or no, effort on the part of the developer, taking advantage of already existing algorithms and software. We consider a class of such methods, where the multigrid only appears as a black-box tool for constructing the preconditioner of the stiffness matrix, and the base iterative algorithm is one of well-known off-the-shelf preconditioned gradient methods such as the locally optimal block preconditioned conjugate gradient method. We review some known theoretical results for preconditioned gradient methods that guarantee the optimal, with respect to the grid size, convergence speed. Finally, we present results of numerical tests, which demonstrate practical effectiveness of our approach for the locally optimal block conjugate gradient method preconditioned by the standard V-cycle multigrid applied to the stiffness matrix.

Full Text (PDF) [216 KB]

Key words

symmetric eigenvalue problems, multigrid preconditioning, preconditioned conjugate gradient iterative method

AMS subject classifications

65N25, 65N55, 65F15.

Links to the cited ETNA articles

[34]Vol. 7 (1998), pp. 104-123 Andrew V. Knyazev: Preconditioned eigensolvers - an oxymoron?

ETNA articles which cite this article

Vol. 46 (2017), pp. 424-446 Ming Zhou and Klaus Neymeyr: Sharp Ritz value estimates for restarted Krylov subspace iterations

< Back