Numerical Behavior of Saddle-Point Solvers

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


As we have seen in previous sections, a large amount of work has been devoted to solution techniques for saddle-point problems varying from the fully direct approach, through the use of iterative stationary and Krylov subspace methods up to the combination of direct and iterative techniques including preconditioning. Significantly less attention however has been paid so far to the numerical behavior of saddle-point solvers.


  1. 37.
    A. Greenbaum, Iterative Methods for Solving Linear Systems (SIAM, Philadelphia, 1997)CrossRefGoogle Scholar
  2. 40.
    N.J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd edn. (SIAM, Philadelphia, 2002)CrossRefGoogle Scholar
  3. 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
  4. 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
  5. 71.
    M. Rozložník, V. Simoncini, Krylov subspace methods for saddle point problems with indefinite preconditioning. SIAM J. Matrix Anal. Appl. 24(2), 368–391 (2002)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