Volume 39, pp. 156-185, 2012.

Spectral deflation in Krylov solvers: a theory of coordinate space based methods

Martin H. Gutknecht


For the iterative solution of large sparse linear systems we develop a theory for a family of augmented and deflated Krylov space solvers that are coordinate based in the sense that the given problem is transformed into one that is formulated in terms of the coordinates with respect to the augmented bases of the Krylov subspaces. Except for the augmentation, the basis is as usual generated by an Arnoldi or Lanczos process, but now with a deflated, singular matrix. The idea behind deflation is to explicitly annihilate certain eigenvalues of the system matrix, typically eigenvalues of small absolute value. The deflation of the matrix is based on an either orthogonal or oblique projection on a subspace that is complimentary to the deflated approximately invariant subspace. While an orthogonal projection allows us to find minimal residual norm solutions, the oblique projections, which we favor when the matrix is non-Hermitian, allow us in the case of an exactly invariant subspace to correctly deflate both the right and the corresponding left (possibly generalized) eigenspaces of the matrix, so that convergence only depends on the non-deflated eigenspaces. The minimality of the residual is replaced by the minimality of a quasi-residual. Among the methods that we treat are primarily deflated versions of GMRES, MINRES, and QMR, but we also extend our approach to deflated, coordinate space based versions of other Krylov space methods including variants of CG and BICG. Numerical results will be published elsewhere.

Full Text (PDF) [389 KB]

Key words

Linear equations, Krylov space method, Krylov subspace method, deflation, augmented basis, recycling Krylov subspaces, (singular) preconditioning, GMRES, MINRES, QMR, CG, BICG

AMS subject classifications

ETNA articles which cite this article

Vol. 43 (2014-2015), pp. 125-141 Erin Carson, Nicholas Knight, and James Demmel: An efficient deflation technique for the communication-avoiding conjugate gradient method

< Back