Advertisement

Solution Approaches for Saddle-Point Problems

  • Miroslav Rozložník
Chapter
Part of the Nečas Center Series book series (NECES)

Abstract

Although their distinction can be rather minor in some cases, the solution algorithms for the saddle-point problems ( 1.1) with ( 1.3) can be divided into two basic subcategories called coupled (all-at-once) methods and segregated methods:

References

  1. 12.
    M. Benzi, G.H. Golub, J. Liesen, Numerical solution of saddle point problems. Acta Numerica 14, 1–137 (2005)MathSciNetCrossRefGoogle Scholar
  2. 45.
    P. Jiránek, M. Rozložník, Maximum attainable accuracy of inexact saddle point solvers. SIAM J. Matrix Anal. Appl. 29(4), 1297–1321 (2008)MathSciNetCrossRefGoogle Scholar
  3. 46.
    P. Jiránek, M. Rozložník, Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems. J. Comput. Appl. Math. 215, 28–37 (2008)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Miroslav Rozložník
    • 1
  1. 1.Institute of MathematicsCzech Academy of SciencesPragueCzech Republic

Personalised recommendations