Skip to main content

Robust Preconditioners for Saddle Point Problems

  • Conference paper
  • First Online:
Numerical Methods and Applications (NMA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2542))

Included in the following conference series:

Abstract

We survey preconditioning methods for matrices on saddle point form, as typically arising in constrained optimization problems. Special consideration is given to indefinite matrix preconditioners and a preconditioner which results in a symmetric positive definite matrix, which latter may enable the use of the standard conjugate gradient (CG) method. These methods result in eigenvalues with positive real parts and small or zero imaginary parts. The behaviour of some of these techniques is illustrated on solving a regularized Stokes problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Axelsson O.: Preconditioning of indefinite problems by regularization. SIAM Journal on Numerical Analysis, 16 (1979), 58–69.

    Article  MATH  MathSciNet  Google Scholar 

  2. Axelsson O.: Iterative Solution Methods, Cambridge University Press, Cambridge, 1994.

    MATH  Google Scholar 

  3. Axelsson O., Barker V.A., Neytcheva M., Polman B.: Solving the Stokes problem on a massively parallel computer. Mathematical Modelling and Analysis, 4 (2000), 1–22.

    Google Scholar 

  4. Axelsson O., Gustafsson I.: An iterative solver for a mixed variable variational formulation of the (first) biharmonic problem. Computer Methods in Applied Mechanics and Engineering, 20 (1979), 9–16.

    Article  MathSciNet  MATH  Google Scholar 

  5. Axelsson O., Gustafsson I.: An efficient finite element method for nonlinear diffusion problems. Bulletin Greek Mathematical Society, 22 (1991), 45–61.

    MathSciNet  Google Scholar 

  6. Axelsson O, Makarov M. On a generalized conjugate orthogonal residual method. Numerical Linear Algebra with Applications, 1995; 2:467–480.

    Article  MATH  MathSciNet  Google Scholar 

  7. Axelsson O., Neytcheva M.: Preconditioning methods for linear systems arising in constrained optimization problems. Submitted to Numerical Linear Algebra with Applications, January 2002.

    Google Scholar 

  8. Axelsson O., Vassilevski P.S.: Variable-step multilevel preconditioning methods. I. Selfadjoint and positive definite elliptic problems. Numer. Linear Algebra Appl., 1 (1994), 75–101.

    Article  MATH  MathSciNet  Google Scholar 

  9. Braess D.: Finite Elements. Theory, fast solvers, and applications in solid mechanics. Cambridge University Press, Cambridge, 2001. (Second edition)

    MATH  Google Scholar 

  10. Bramble JH, Pasciak JE.: A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems. Mathematics of Computation, 1988; 50:1–17.

    Article  MATH  MathSciNet  Google Scholar 

  11. Elman H.C.: Preconditioning for the steady-state Navier-Stokes equations with low viscosity. SIAM Journal on Scientific Computing, 20 (1999), 1299–1316.

    Article  MATH  MathSciNet  Google Scholar 

  12. H.C. Elman and D. Silvester, Fast nonsymmetric iterations and preconditioning for Navier-Stokes equations. SIAM Journal on Scientific Computing, 17 (1996), 33–46.

    Article  MATH  MathSciNet  Google Scholar 

  13. Ewing R.E., Lazarov R., Lu P., Vassilevski P.: Preconditioning indefinite systems arising from mixed finite element discretization of second order elliptic problems. In Axelsson O., Kolotilina L. (eds.): Lecture Notes in Mathematics, 1457, Springer-Verlag, Berlin, 1990.

    Google Scholar 

  14. Klawonn A.: Block-triangular preconditioners for saddle point problems with a penalty term. SIAM Journal on Scientific Computing, 1998; 19:172–184.

    Article  MATH  MathSciNet  Google Scholar 

  15. Luksan L., Vlcek J.: Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems. Numerical Linear Algebra with Applications, 5(1998), 219–247.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Axelsson, O., Neytcheva, M. (2003). Robust Preconditioners for Saddle Point Problems. In: Dimov, I., Lirkov, I., Margenov, S., Zlatev, Z. (eds) Numerical Methods and Applications. NMA 2002. Lecture Notes in Computer Science, vol 2542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36487-0_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-36487-0_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00608-4

  • Online ISBN: 978-3-540-36487-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics