Abstract
A general purpose block LU preconditioner for saddle point problems is presented. A major difference between the approach presented here and that of other studies is that an explicit, accurate approximation of the Schur complement matrix is efficiently computed. This is used to obtain a preconditioner to the Schur complement matrix which in turn defines a preconditioner for the global system. A number of variants are developed and results are reported for a few linear systems arising from CFD applications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Arrow, L. Hurwicz and H. Uzawa, Studies in Nonlinear Programming (Stanford Univ. Press, Stanford, CA, 1958).
R.E. Bank, B.D. Welfert and H. Yserentant, A class of iterative methods for solving saddle point problems, Numer. Math. 55 (1990) 645–666.
J.H. Bramble, J.E. Pasciak and A.T. Vassilev, Analysis of the inexact Uzawa algorithm for saddle point problems, SIAM J. Numer. Anal. 5 (1997) 1072–1092.
J.H. Bramble, A.T. Vassilev and J.E. Pasciak, Uzawa-type algorithms for nonsymmetric saddle point problems, Math. Comp., to appear.
H. Choi, Personal communication, University of Minnesota, Department of Aerospace Engineering and Mechanics (1999).
N. Dyn and W. Ferguson, The numerical solution of equality-constrained quadratic programming problems, Math. Comp. 41 (1983) 165–170.
H. Elman, A stability analysis of incomplete LU factorizations, Math. Comp. 47 (1986) 191–217.
H. Elman, Perturbation of eigenvalues of preconditioned Navier–Stokes operators, SIAM J. Matrix Anal. Appl. B 18 (1997) 733–751.
H. Elman, Preconditioning for the steady-state Navier–Stokes equations at low viscosity, SIAMJ. Sci. Comput. 20(4) (1999) 1299–1316.
H. Elman and D. Silvester, Fast nonsymmetric iterations and preconditioning for Navier–Stokes equations, SIAM J. Sci. Comput. 17 (1996) 33–46.
G. Golub and A. Wathen, An iteration for indefinite systems and its application to the Navier–Stokes equations, SIAM J. Sci. Comput. 19 (1998) 530–539.
M. Jones and P. Plassman, An improved incomplete Choleski factorization, ACM TOMS 21 (1995) 5–17.
A. Klawonn, Block-triangular preconditioners for saddle point problems with a penalty term, SIAM J. Sci. Comput. 19 (1998) 172–184.
A. Klawonn, An optimal preconditioner for a class of saddle point problems with a penalty term, SIAM J. Sci. Comput. 19 (1998) 540–552.
L. Little, A finite-element solver for the Navier–Stokes equations using a preconditioned adaptive Bicgstab(l) method, Ph.D. thesis, Arizona State University (1998).
I. Perugia, V. Simoncini and M. Arioli, Linear algebra methods in a mixed approximation of magnetostatic problems, IAN-CNR Technical Report 1060 (1997).
T. Rusten and R. Winther, A preconditioned iterative method for saddle point problems, SIAM J. Matrix Anal. Appl. 13 (1992) 887–904.
Y. Saad, Preconditioning techniques for nonsymmetric and indefinite linear systems, J. Comput. Appl. Math. 24 (1988) 89–105.
Y. Saad, Iterative Methods for Sparse Linear Systems (PWS, New Jersey, 1996).
Y. Saad and J. Zhang, BILUTM: A domain-based multi-level block ILUT preconditioner for general sparse matrices, Technical Report UMSI-97-118, Minnesota Supercomputing Institute, Minneapolis, MN (1998).
D.J. Silvester and A.J. Wathen, Fast iterative solution of stabilised Stokes systems Part II: Using general block preconditioners, SIAM J. Numer. Anal. 31 (1994) 1352–1367.
R. Verfurth, A combined conjugate gradient-multigrid algorithm for the numerical solution of the Stokes problem, IMA J. Numer. Anal. 4 (1984) 441–455.
A.J. Wathen and D.J. Silvester, Fast iterative solution of stabilised Stokes systems Part I: Using simple diagonal preconditioners, SIAM J. Numer. Anal. 30 (1993) 630–649.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Little, L., Saad, Y. Block Preconditioners for Saddle Point Problems. Numerical Algorithms 33, 367–379 (2003). https://doi.org/10.1023/A:1025544928604
Issue Date:
DOI: https://doi.org/10.1023/A:1025544928604