Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems

Authors:
H. Sue Dollar;Nicholas I. M. Gould;Wil H. A. Schilders;Andrew J. Wathen
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2006

Citing 0
Cited 6

Mixed Constraint Preconditioners for the iterative solution of FE coupled consolidation equations

Journal of Computational Physics
On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods

Computational Optimization and Applications
Preconditioned Conjugate Gradient Method for Optimal Control Problems with Control and State Constraints

SIAM Journal on Matrix Analysis and Applications
Matrix-free interior point method

Computational Optimization and Applications
A preconditioning technique for Schur complement systems arising in stochastic optimization

Computational Optimization and Applications
Reduced order solution of structured linear systems arising in certain PDE-constrained optimization problems

Computational Optimization and Applications

Quantified Score

Hi-index	0.01

Visualization

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.