On HSS-based constraint preconditioners for generalized saddle-point problems
Original Paper
First Online:
Received:
Accepted:
- 314 Downloads
- 17 Citations
Abstract
For the generalized saddle-point problems with non-Hermitian (1,1) blocks, we present an HSS-based constraint preconditioner, in which the (1,1) block of the preconditioner is constructed by the HSS method for solving the non-Hermitian positive definite linear systems. We analyze the invertibility of the HSS-based constraint preconditioner and prove the convergence of the preconditioned iteration method. Numerical experiments are used to demonstrate the efficiency of the preconditioner as well as the corresponding preconditioned iteration method, especially when the (1,1) block of the saddle-point matrix is essentially non-Hermitian.
Keywords
Saddle-point problem Iterative method Preconditioning method Non-Hermitian indefinite linear system HSS-based preconditionerMathematics Subject Classifications (2010)
65F08 65F10 65F22 65F35 65N22Preview
Unable to display preview. Download preview PDF.
References
- 1.Arioli, M., Baldini, L.: A backward error analysis of a null space algorithm in sparse quadratic programming. SIAM J. Matrix Anal. Appl. 23, 425–442 (2001)MathSciNetMATHCrossRefGoogle Scholar
- 2.Bai, Z.-Z.: Structured preconditioners for nonsingular matrices of block two-by-two structures. Math. Comput. 75, 791–815 (2006)MATHGoogle Scholar
- 3.Bai, Z.-Z.: Optimal parameters in the HSS-like methods for saddle-point problems. Numer. Linear Algebra Appl. 16, 447–479 (2009)MathSciNetCrossRefGoogle Scholar
- 4.Bai, Z.-Z., Golub, G.H.: Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems. IMA J. Numer. Anal. 27, 1–23 (2007)MathSciNetMATHCrossRefGoogle Scholar
- 5.Bai, Z.-Z., Golub, G.H., Ng, M.K.: Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. SIAM J. Matrix Anal. Appl. 24, 603–626 (2003)MathSciNetMATHCrossRefGoogle Scholar
- 6.Bai, Z.-Z., Golub, G.H., Pan, J.-Y.: Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems. Numer. Math. 98, 1–32 (2004)MathSciNetMATHCrossRefGoogle Scholar
- 7.Bai, Z.-Z., Ng, M.K.: On inexact preconditioners for nonsymmetric matrices. SIAM J. Sci. Comput. 26, 1710–1724 (2005)MathSciNetMATHCrossRefGoogle Scholar
- 8.Bai, Z.-Z., Ng, M.K., Wang, Z.-Q.: Constraint preconditioners for symmetric indefinite matrices. SIAM J. Matrix Anal. Appl. 31, 410–433 (2009)MathSciNetMATHCrossRefGoogle Scholar
- 9.Bai, Z.-Z., Parlett, B.N., Wang, Z.-Q.: On generalized successive overrelaxation methods for augmented linear systems. Numer. Math. 102, 1–38 (2005)MathSciNetMATHCrossRefGoogle Scholar
- 10.Bai, Z.-Z., Wang, Z.-Q.: On parameterized inexact Uzawa methods for generalized saddle point problems. Linear Algebra Appl. 428, 2900–2932 (2008)MathSciNetMATHCrossRefGoogle Scholar
- 11.Benzi, M., Golub, G.H.: A preconditioner for generalized saddle point problems. SIAM J. Matrix Anal. Appl. 26, 20–41 (2004)MathSciNetMATHCrossRefGoogle Scholar
- 12.Benzi, M., Golub, G.H., Liesen, J.: Numerical solution of saddle point problems. Acta Numer. 14, 1–137 (2005)MathSciNetMATHCrossRefGoogle Scholar
- 13.Botchev, M.A., Gloub, G.H.: A class of nonsymmetic preconditioners for saddle point problems. SIAM J. Matrix Anal. Appl. 27, 1125–1149 (2006)MathSciNetMATHCrossRefGoogle Scholar
- 14.Bramble, J.H., Pasciak, J.E., Vassilev, A.T.: Analysis of the inexact Uzawa algorithm for saddle point problems. SIAM J. Numer. Anal. 34, 1072–1092 (1997)MathSciNetMATHCrossRefGoogle Scholar
- 15.Bramble, J.H., Pasciak, J.E., Vassilev, A.T.: Uzawa type algorithms for nonsymmetric saddle-point problems. Math. Comput. 69, 667–689 (2000)MathSciNetMATHGoogle Scholar
- 16.Brenner, S.C., Scott, L.R.: The Mathematical Theory of Finite Element Methods. Springer, Berlin (2002)MATHGoogle Scholar
- 17.Duff, I.S., Gould, N.I.M., Reid, J.K., Scott, J.A., Turner, K.: The factorization of sparse symmetric indefinite matrices. IMA J. Numer. Anal. 11, 181–204 (1991)MathSciNetMATHCrossRefGoogle Scholar
- 18.Dyn, N., Ferguson Jr., W.E.: The numerical solution of equality constrained quadratic programming problems. Math. Comput. 41, 165–170 (1983)MathSciNetMATHGoogle Scholar
- 19.Elman, H.C.: Preconditioners for saddle point problems arising in computational fluid dynamics. Appl. Numer. Math. 43, 75–89 (2002)MathSciNetMATHCrossRefGoogle Scholar
- 20.Elman, H.C., Golub, G.H.: Inexact and preconditioned Uzawa algorithms for saddle point problems. SIAM J. Numer. Anal. 31, 1645–1661 (1994)MathSciNetMATHCrossRefGoogle Scholar
- 21.Elman, H., Silvester, D.: Fast nonsymmetric iterations and preconditioning for Navier–Stokes equations. SIAM J. Sci. Comput. 17, 33–46 (1996)MathSciNetMATHCrossRefGoogle Scholar
- 22.Elman, H.C., Silvester, D.J., Wathen, A.J.: Iterative methods for problems in computational fluid dynamics. In: Iterative Methods in Scientific Computing (Hong Kong, 1995), pp. 271–327. Springer, Singapore (1997)Google Scholar
- 23.Gill, P.E., Murray, W., Ponceleon, D.B., Saunders, M.A.: Preconditioners for indefinite systems arising in optimization. SIAM J. Matrix Anal. Appl. 13, 292–311 (1992)MathSciNetMATHCrossRefGoogle Scholar
- 24.Girault, V., Raviart, P.A.: Finite Element Approximation of the Navier–Stokes Equations. Springer, Berlin (1979)MATHCrossRefGoogle Scholar
- 25.Glowinski, R.: Numerical Methods for Nonlinear Variational Problems. Springer, New York (1984)MATHGoogle Scholar
- 26.Golub, G.H., Greif, C.: On solving block-structured indefinite linear systems. SIAM J. Sci. Comput. 24, 2076–2092 (2003)MathSciNetMATHCrossRefGoogle Scholar
- 27.Golub, G.H., Wathen, A.J.: An iteration for indefinite systems and its application to the Navier–Stokes equations. SIAM J. Sci. Comput. 19, 530–539 (1998)MathSciNetMATHCrossRefGoogle Scholar
- 28.Golub, G.H., Wu, X., Yuan, J.-Y.: SOR-like methods for augmented systems. BIT 41, 71–85 (2001)MathSciNetMATHCrossRefGoogle Scholar
- 29.Gould, N.I.M., Hribar, M.E., Nocedal, J.: On the solution of equality constrained quadratic programming problems arising in optimization. SIAM J. Sci. Comput. 23, 1375–1394 (2001)MathSciNetCrossRefGoogle Scholar
- 30.Kay, D., Loghin, D., Wathen, A.J.: A preconditioner for the steady-state Navier–Stokes equations. SIAM J. Sci. Comput. 24, 237–256 (2002)MathSciNetMATHCrossRefGoogle Scholar
- 31.Keller, C., Gould, N.I.M., Wathen, A.J.: Constraint preconditioning for indefinite linear systems. SIAM J. Matrix Anal. Appl. 21, 1300–1317 (2000)MathSciNetMATHCrossRefGoogle Scholar
- 32.Monk, P.: Finite Element Methods for Maxwell’s Equations. Oxford University Press, New York (2003)MATHCrossRefGoogle Scholar
- 33.Pan, J.-Y., Ng, M.K., Bai, Z.-Z.: New preconditioners for saddle point problems. Appl. Math. Comput. 172, 762–771 (2006)MathSciNetMATHCrossRefGoogle Scholar
- 34.Plemmons, R.J.: A parallel block iterative method applied to computations in structural analysis. SIAM J. Algebr. Discrete Methods 7, 337–347 (1986)MathSciNetMATHCrossRefGoogle Scholar
- 35.Sarin, V., Sameh, A.: An efficient iterative method for the generalized Stokes problem. SIAM J. Sci. Comput. 19, 206–226 (1998)MathSciNetMATHCrossRefGoogle Scholar
- 36.Silvester, D.J., Elman, H.C., Kay, D., Wathen, A.J.: Efficient preconditioning of the linearized Navier–Stokes equations for incompressible flow. J. Comput. Appl. Math. 128, 261–279 (2001)MathSciNetMATHCrossRefGoogle Scholar
Copyright information
© Springer Science+Business Media, LLC. 2010