Abstract
Preconditioners are often applied in various Krylov subspace iteration methods to improve their computing efficiency. In this paper, we consider solving linear systems with a non-Hermitian positive definite coefficient matrix using preconditioned Krylov subspace iteration methods such as the generalized minimal residual (GMRES) method. An \(m\)-step polynomial preconditioner is designed based on the Hermitian and skew-Hermitian splitting (HSS) iteration method proposed by Bai et al. (SIAM J Matrix Anal Appl 24:603–626, 2003). The proposed preconditioned system is solved by fully utilizing the HSS iteration method. Theoretical and experimental results show that the proposed \(m\)-step preconditioner is efficient in accelerating GMRES for solving a non-Hermitian positive definite linear system.
Similar content being viewed by others
References
Bai Z-Z, Li G-Q (2003) Restrictively preconditioned conjugate gradient methods for systems of linear equations. IMA J Numer Anal 23:561–580
Bai Z-Z, Wang Z-Q (2006) Restrictive preconditioners for conjugate gradient methods for symmetric positive definite linear systems. J Comput Appl Math 187:202–226
Hestenes MR, Stiefel EL (1952) Methods of conjugate gradients for solving linear systems. J Res Nat Bur Stand 49:409–436
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
Van Der Vorst HA (1992) Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of non-symmetric linear systems. SIAM J Sci Stat Comput 12:631–644
Van Der Vorst HA, Vuik C (1994) GMRESR: a family of nested GMRES methods. Numer Linear Algebra Appl 1:369–386
Kershaw DS (1978) The incomplete Choleski conjugate gradient method for the iterative solution of systems of linear equations. J Comput Phys 26:43–65
Notay Y (2000) Flexible conjugate gradient. SIAM J Sci Comput 22:1444–1460
Saad Y (1993) A flexible inner–outer preconditioned GMRES algorithm. SIAM J Sci Comput 14:461–469
Saad Y (2003) Iterative methods for sparse linear systems, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia
Sonneveld P (1989) CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J Sci Stat Comput 10:36–52
Ashcraft CC, Grimes RG (1988) On vectorizing incomplete factorization and SSOR preconditioners. SIAM J Sci Stat Comput 9:122–151
Bai Z-Z (1999) A class of modified block SSOR preconditioners for symmetric positive definite systems of linear equations. Adv Comput Math 10:169–186
Bai Z-Z (2006) Structured preconditioners for nonsingular matrices of block two-by-two structures. Math Comput 75:791–815
Bai Z-Z, Huang Y-M, Ng MK (2010) Block-triangular preconditioners for systems arising from edge-preserving image restoration. J Comput Math 6:848–863
Wang X, Gallivan K, Bramley R (1997) CIMGS: an incomplete orthogonal factorization preconditioner. SIAM J Sci Comput 18:516–536
Adams LM (1985) \(m\)-step preconditioned conjugate gradient methods. SIAM J Sci Stat Comput 6:452–463
Adams LM, Ong EG (1988) Additive polynomial preconditioners for parallel computers. Parallel Comput 9:333–345
Cao Z-H, Wang Y (2002) On validity of \(m\)-step multisplitting preconditioners for linear systems. Appl Math comput 126:199–211
Hadjidimos A, Yeyios AK (1996) Some notes on multisplltting methods and \(m\)-step preconditioners for linear systems. Linear Algebra Appl 248:277–301
Harrar DL II, Ortega JM (1988) Optimum \(m\)-step SSOR preconditioning. J Comput Appl Math 24:195–198
Ortega JM (1972) Numerical analysis:a second course. Academic Press, New York
Axelsson O (1994) Iterative solution methods. Cambridge University Press, Cambridge
Bai Z-Z (1997) A class of two-stage iterative methods for systems of weakly nonlinear equations. Numer Algorithm 14:295–319
Bai Z-Z (1998) The convergence of the two-stage iterative method for Hermitian positive definite linear systems. Appl Math Lett 11:1–5
Bai Z-Z, Sun J-C, Wang D-R (1996) A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations. Comput Math Appl 32:51–76
Bai Z-Z, Wang D-R (1997) The monotone convergence of the two-stage iterative method for solving large sparse systems of linear equations. Appl Math Lett 10:113–117
Hadjidimos A, Yeyios AK (1992) On multisplitting methods and \(m\)-step preconditioners for parallel and vector machines. Technical report, CAPO report. Department of Computer Sciences, Purdue University, Purdue
Axelsson O, Bai Z-Z, Qiu S-X (2004) A class of nested iteration schemes for linear systems with a coefficient matrix with a dominant positive definite symmetric part. Numer Algorithm 35:351–372
Bai Z-Z, Golub GH, Li C-K (2006) Optimal parameter in Hermitian and skew-Hermitian splitting method for certain two-by-two block matrices. SIAM J Sci Comput 28:583–603
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, Golub GH, Ng MK (2007) On successive-overrelaxation acceleration of the Hermitian and skew-Hermitian splitting iterations. Numer Linear Algebra Appl 14:319–335
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
Huang YM (2014) A practical formula for computing optimal parameters in the HSS iteration methods. J Comput Appl Math 255:142–149
Bai Z-Z, Golub GH, Lu L-Z, Yin J-F (2005) Block triangular and skew-Hermitian splitting methods for positive-definite linear systems. SIAM J Sci Comput 26:844–863
Benzi M (2009) A generalization of the Hermitian and skew-Hermitian splitting iteration. SIAM J Matrix Anal Appl 31:360–374
Benzi M, Golub GH (2004) A preconditioner for generalized saddle point problems. SIAM J Matrix Anal Appl 26:20–41
Benzi M, Ng MK (2006) Preconditioned iterative methods for weighted Toeplitz least squares problems. SIAM J Matrix Anal Appl 27:1106–1124
Bertaccini D, Golub GH, Serra Capizzano S, Possio CT (2005) Preconditioned HSS methods for the solution of non-Hermitian positive definite linear systems and applications to the discrete convection–diffusion equation. Numer Math 99:441–484
Ng MK (2003) Circulant and skew-circulant splitting methods for Toeplitz systems. J Comput Appl Math 159:101–108
Simoncini V, Benzi M (2004) Spectral properties of the Hermitian and skew-Hermitian splitting preconditioner for saddle point problems. SIAM J Matrix Anal Appl 26:377–389
Yang AL, An J, Wu YJ (2010) A generalized preconditioned HSS method for non-Hermitian positive definite linear systems. Appl Math Comput 216:1715–1722
Zhang GF, Ren ZR, Zhou YY (2011) On HSS-based constraint preconditioners for generalized saddle-point problems. Numer Algorithm 57:273–287
Bai Z-Z, Golub GH, Li C-K (2007) Convergence properties of preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite matrices. Math Comput 76:287–298
Chan LC, Ng MK, Tsing NK (2006) Spectral analysis for HSS preconditioners. Numer Math Theory Methods Appl 15:1–18
Acknowledgments
Research supported in part by NSFC Grant 11101195 and China Postdoctoral Science Foundation funded Project 2011M501488.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Huang, YM. On \({\varvec{m}}\)-step Hermitian and skew-Hermitian splitting preconditioning methods. J Eng Math 93, 77–86 (2015). https://doi.org/10.1007/s10665-013-9676-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10665-013-9676-z