Our focus in this chapter will be on iterative algorithmsfor solving (10.1). Chap. 10.1 describes various properties of saddle point systems. Chap. 10.2 introduces the dualityformulation and Uzawa's algorithm. Chap. 10.3 describes the penalty and regularizationmethod for obtaining an approximate solution. Chap. 10.4 describes projection methods. Chap. 10.5 describes block matrixpreconditioners and Krylov algorithms. Applications to Navier-Stokes equations, mixed formulations of elliptic equations, and to optimal control problems, are described in Chaps. 10.6, 10.7 and 10.8, respectively. For a more detailed discussion of saddle point problems, readers are referred to [CI4, GI3, BE12].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Saddle Point Problems. In: Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations. Lecture Notes in Computational Science and Engineering, vol 61. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77209-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-77209-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77205-7
Online ISBN: 978-3-540-77209-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)