Uzawa-Type and Augmented Lagrangian Methods for Double Saddle Point Systems

  • Michele BenziEmail author
  • Fatemeh Panjeh Ali Beik
Part of the Springer INdAM Series book series (SINDAMS, volume 30)


We study different types of stationary iterative methods for solving a class of large, sparse linear systems with double saddle point structure. In particular, we propose a class of Uzawa-like methods including a generalized (block) Gauss-Seidel (GGS) scheme and a generalized (block) successive overrelaxation (GSOR) method. Both schemes rely on a relaxation parameter, and we establish convergence intervals for these parameters. Additionally, we investigate the performance of these methods in combination with an augmented Lagrangian approach. Numerical experiments are reported for test problems from two different applications, a mixed-hybrid discretization of the potential fluid flow problem and finite element modeling of liquid crystal directors. Our results show that fast convergence can be achieved with a suitable choice of parameters.


Uzawa-like methods Double saddle point problems Augmented Lagrangian method Finite elements Potential fluid flow Liquid crystals 

AMS Subject Classifications:

65F10 65F08 65F50 



We would like to thank Alison Ramage and Miroslav T Open image in new window ma for providing the test problems used in the numerical experiments. We also express our sincere thank to two anonymous referees for their valuable comments and helpful suggestions. The second author is grateful for the hospitality of the Department of Mathematics and Computer Science at Emory University, where part of this work was completed.


  1. 1.
    Beik, F.P.A., Benzi, M.: Iterative methods for double saddle point systems. SIAM J. Matrix Anal. Appl. 39, 602–621 (2018)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Benzi, M.: Preconditioning techniques for large linear systems: a survey. J. Comput. Phys. 182, 417–477 (2002)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Benzi, M., Golub, G.H., Liesen, J.: Numerical solution of saddle point problems. Acta Numer. 14, 1–137 (2005)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Benzi, M., Evans, T.M., Hamilton, S.P., Lupo Pasini, M., Slattery, S.R.: Analysis of Monte Carlo accelerated iterative methods for sparse linear systems. Numer. Linear Algebra Appl. 24, e2008 (2017)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Boffi, D., Brezzi, F., Fortin, M.: Mixed Finite Element Methods and Applications. Springer Series in Computational Mathematics. Springer, New York (2013)CrossRefGoogle Scholar
  6. 6.
    Elman, H.C., Golub, G.H.: Inexact and preconditioned Uzawa algorithms for saddle point problems. SIAM J. Numer. Anal. 31, 1645–1661 (1994)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Hoemmen, M.: Communication-avoiding Krylov subspace methods. Doctoral Dissertation, University of California at Berkeley, Berkeley (2010)Google Scholar
  8. 8.
    Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)CrossRefGoogle Scholar
  9. 9.
    Lupo Pasini, M.: Convergence analysis of Anderson-type acceleration of Richardson’s iteration, Preprint, Department of Mathematics and Computer Science, Emory University (2017)Google Scholar
  10. 10.
    Maryška, J., Rozložník, M., Tůma, M.: Schur complement systems in the mixed-hybrid finite element approximation of the potential fluid flow problem. SIAM J. Sci. Comput. 22, 704–723 (2005)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Pratapa, P.P., Suryanarayana, P., Pask, J.E.: Anderson acceleration of the Jacobi iterative method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems. J. Comput. Phys. 306, 43–54 (2016)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Pratapa, P.P., Suryanarayana, P., Pask, J.E.: Alternating Anderson-Richardson method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems. Comput. Phys. Commun. 234, 278–285 (2019)CrossRefGoogle Scholar
  13. 13.
    Ramage, A., Gartland, E.C., Jr.: A preconditioned nullspace method for liquid crystal director modeling. SIAM J. Sci. Comput. 35, B226–B247 (2013)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Saad, S.: Iterative Methods for Sparse Linear Systems, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2003)CrossRefGoogle Scholar
  15. 15.
    Stoyanov, M., Webster, C.: Numerical analysis of fixed point algorithms in the presence of hardware faults. SIAM J. Sci. Comput. 35, C532–C553 (2015)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Walker, H.F., Ni, P.: Anderson acceleration for fixed-point iterations. SIAM J. Numer. Anal. 49, 1715–1735 (2015)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Yamazaki, I., Rajamanickam, S., Boman, E.G., Hoemmen, M., Heroux, M., Tomov, S.: Domain decomposition preconditioners for communication-avoiding Krylov subspace methods on a hybrid CPU/GPU cluster. In: International Conference on High Performance Computing, Networking, Storage and Analysis, SC, pp. 933–944 (2015)Google Scholar
  18. 18.
    Young, D.M.: Iterative Solution or Large Linear Systems. Academic Press, New York (1971)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceEmory UniversityAtlantaUSA
  2. 2.Classe di ScienzeScuola Normale SuperiorePisaItaly
  3. 3.Department of MathematicsVali-e-Asr University of RafsanjanRafsanjanIran

Personalised recommendations