Abstract
A preconditioner is proposed for the large and sparse linear saddle point problems, which is based on a low-order three-by-three block saddle point form. The eigenvalue distribution and an upper bound of the degree of the minimal polynomial for the preconditioned matrix are discussed. Numerical results show that the optimal convergence behavior can be achieved when the new preconditioner is used to accelerate the convergence rate of Krylov subspace methods such as GMRES.
Similar content being viewed by others
References
Arrow K, Hurwicz L, Uzawa H (1958) Studies in linear and nonlinear programming. Stanford University Press, Stanford
Bai Z-Z (2009) Optimal parameters in the HSS-like methods for saddle-point problems. Numer Linear Algebra Appl 16:447–479
Bai Z-Z (2016) On SSOR-like preconditioners for non-Hermitian positive definite matrices. Numer Linear Algebra Appl 23:37–60
Bai Z-Z, Golub GH (2007) Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems. IMA J Numer Anal 27:1–23
Bai Z-Z, Ng MK (2005) On inexact preconditioners for nonsymmetric matrices. SIAM J Sci Comput 26:1710–1724
Bai Z-Z, Wang Z-Q (2008) On parameterized inexact Uzawa methods for generalized saddle point problems. Linear Algebra Appl 428:2900–2932
Bai Z-Z, Golub GH, Ng MK (2003) Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. SIAM J Matrix Anal Appl 24:603–626
Bai Z-Z, Golub GH, Pan J-Y (2004) Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems. Numer Math 98:1–32
Benzi M, Golub GH (2004) A preconditioner for generalized saddle point problems. SIAM J Matrix Anal Appl 26:20–41
Benzi M, Golub GH, Liesen J (2005) Numerical solution of saddle point problems. Acta Numer 14:1–137
Bergen AR, Vittal V (1986) Power systems analysis. Prentice Hall, Englewood Cliffs
Braess D (2001) Finite elements: theory, fast solvers, and applications in solid mechanics, 2nd edn. Cambridge University Press, Cambridge
Bramble JH, Pasciak JE, Vassilev AT (1997) Analysis of the inexact Uzawa algorithm for saddle point problems. SIAM J Numer Anal 34:1072–1092
Bramble JH, Pasciak JE, Vassilev AT (2000) Uzawa type algorithms for nonsymmetric saddle point problems. Math Comput 69:667–689
Brezzi F, Fortin M (1991) Mixed and hybrid finite element methods. Springer series in computational mathematics, vol 15. Springer, New York
Cao Z-H (2004) Fast Uzawa algorithms for solving non-symmetric stabilized saddle point problems. Numer Linear Algebra Appl 11:1–24
Cao Y, Yi S-C (2016) A class of Uzawa-PSS iteration methods for nonsingular and singular non-Hermitian saddle point problems. Appl Math Comput 275:41–49
Cao Y, Yao L-Q, Jiang M-Q, Niu Q (2013) A relaxed HSS preconditioner for saddle point problems from meshfree discretization. J Comput Math 31:398–421
Cao Y, Li S, Yao L-Q (2015) A class of generalized shift-splitting preconditioners for nonsymmetric saddle point problems. Appl Math Lett 49:20–27
Chen F, Jiang Y-L (2008) A generalization of the inexact parameterized Uzawa methods for saddle point problems. Appl Math Comput 206:765–771
Chen C-R, Ma C-F (2015) A generalized shift-splitting preconditioner for singular saddle point problems. Appl Math Comput 269:947–955
Cheng X-L (2000a) On the nonlinear inexact Uzawa algorithm for saddle-point problems. SIAM J Numer Anal 37:1930–1934
Cheng X-L (2000b) The inexact Uzawa algorithm for saddle point problem. Appl Math Lett 13:1–3
Cheng X-L, Zou J (2003) An inexact Uzawa-type iterative method for solving saddle point problems. Int J Comput Math 80:55–64
Cui M-R (2002) A sufficient condition for the convergence of the inexact Uzawa algorithm for saddle point problems. J Comput Appl Math 139:189–196
Cui M-R (2004) Analysis of iterative algorithms of Uzawa type for saddle point problems. Appl Numer Math 50:133–146
Darvishi MT, Hessari P (2006) Symmetric SOR method for augmented systems. Appl Math Comput 183:409–415
Elman HC, Golub GH (1994) Inexact and preconditioned Uzawa algorithms for saddle point problems. SIAM J Numer Anal 31:1645–1661
Elman HC, Silvester DJ, Wathen AJ (2006) Finite elements and fast iterative solvers. Oxford University Press, New York
Glowinski R (1984) Numerical methods for nonlinear variational problems. Springer series in computational physics, Springer, Berlin
Golub GH, Wu X, Yuan J-Y (2001) SOR-like methods for augmented systems. BIT 41:71–85
Hu Q-Y, Zou J (2002) Two new variants of nonlinear inexact Uzawa algorithms for saddle-point problems. Numer Math 93:333–359
Huang N, Ma C-F, Xie Y-J (2015) An inexact relaxed DPSS preconditioner for saddle point problem. Appl Math Comput 265:431–447
Ke Y-F, Ma C-F (2016) Spectrum analysis of a more general augmentation block preconditioner for generalized saddle point matrices. BIT 56:489–500
Konshin IN, Olshanskii MA, Vassilevski YV (2015) ILU preconditioners for nonsymmetric saddle-point matrices with application to the incompressible Navier-Stokes equations. SIAM J Sci Comput 37:A2171–A2197
Li C-G, Vuik C (2004) Eigenvalue analysis of the SIMPLE preconditioning for incompressible flow. Numer Linear Algebra Appl 11:511–523
Li C-X, Wu S-L, Huang A-Q (2015) A relaxed splitting preconditioner for saddle point problems. J Numer Math 23:361–368
Liu Q-B, Chen G-L, Song C-Q (2014) Preconditioned HSS-like iterative method for saddle point problems. J Comput Math 32:442–455
Shao X, Shen H, Li C (2006) The generalized SOR-like method for the augmented systems. Int J Inf Syst Sci 2:92–98
Van der Vorst HA (2003) Iterative Krylov methods for large linear systems. Cambridge University Press, Cambridge
Wang Z-Q (2009) Optimization of the parameterized Uzawa preconditioners for saddle point matrices. J Comput Appl Math 226:136–154
Wang K, Di J, Liu D (2016) Improved PHSS iterative methods for solving saddle point problems. Numer Algorithms 71:753–773
Wathen AJ (2015) Preconditioning. Acta Numer 24:329–376
Wright MH (1992) Interior methods for constrained optimization. Acta Numer 1:341–407
Wright SJ (1997) Primal dual interior point methods. SIAM, Philadelphia, PA
Wu S-L, Huang T-Z, Zhao X-L (2009) A modified SSOR iterative method for augmented systems. J Comput Appl Math 228:424–433
Yang A-L, Wu Y-J (2014) The Uzawa-HSS method for saddle-point problems. Appl Math Lett 38:38–42
Zhang J-L, Gu C-Q, Zhang K (2014) A relaxed positive-definite and skew-Hermitian splitting preconditioner for saddle point problems. Appl Math Comput 249:468–479
Zhang G-F, Ren Z-R, Zhou Y-Y (2011) On HSS-based constraint preconditioners for generalized saddle-point problems. Numer Algorithms 57:273–287
Zhu M-Z, Zhang G-F, Zheng Z, Liang Z-Z (2014) On HSS-based sequential two-stage method for non-Hermitian saddle point problems. Appl Math Comput 242:907–916
Acknowledgements
The authors would like to express their great thankfulness to the referees for the comments and constructive suggestions very much, which are valuable in improving the quality of the original paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Paul Cizmas.
This work is supported by National Natural Science Foundation of China (Grant No. 11071041), Fujian Natural Science Foundation (Grant No. 2016J01005).
Rights and permissions
About this article
Cite this article
Ke, YF., Ma, CF. A low-order block preconditioner for saddle point linear systems. Comp. Appl. Math. 37, 1959–1970 (2018). https://doi.org/10.1007/s40314-017-0432-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40314-017-0432-2