Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A. Greenbaum, Iterative Methods for Solving Linear Systems (SIAM, Philadelphia, 1997)
N.J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd edn. (SIAM, Philadelphia, 2002)
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)
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)
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)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Rozložník, M. (2018). Numerical Behavior of Saddle-Point Solvers. In: Saddle-Point Problems and Their Iterative Solution. Nečas Center Series. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-01431-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-01431-5_8
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-030-01430-8
Online ISBN: 978-3-030-01431-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)