Implicit-factorization preconditioning and iterative solvers for regularized saddle-point systems

H.S. Dollar, N.I.M. Gould, W.H.A. Schilders, A.J. Wathen

Research output: Contribution to journalArticleAcademicpeer-review

39 Citations (Scopus)
1 Downloads (Pure)

Abstract

We consider conjugate-gradient like methods for solving block symmetric indefinite linear systems that arise from saddle-point problems or, in particular, regularizations thereof. Such methods require preconditioners that preserve certain sub-blocks from the original systems but allow considerable flexibility for the remaining blocks. We construct a number of families of implicit factorizations that are capable of reproducing the required sub-blocks and (some) of the remainder. These generalize known implicit factorizations for the unregularized case. Improved eigenvalue clustering is possible if additionally some of the noncrucial blocks are reproduced. Numerical experiments confirm that these implicit-factorization preconditioners can be very effective in practice.
Original languageEnglish
Pages (from-to)170-189
JournalSIAM Journal on Matrix Analysis and Applications
Volume28
Issue number1
DOIs
Publication statusPublished - 2006

Fingerprint Dive into the research topics of 'Implicit-factorization preconditioning and iterative solvers for regularized saddle-point systems'. Together they form a unique fingerprint.

  • Cite this