Hostname: page-component-6898cfcb55-w5hgh Total loading time: 0 Render date: 2026-11-11T11:30:35.681Z Has data issue: false hasContentIssue false
  • English
  • Français

Efficient Preconditioner and Iterative Method for Large Complex Symmetric Linear Algebraic Systems

Part of:Numerical linear algebraNonlinear algebraic or transcendental equationsBasic linear algebra

Published online by Cambridge University Press:  07 September 2017

Li Dan Liao and
Guo Feng Zhang
Li Dan Liao*
Affiliation:
School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, China
Guo Feng Zhang*
Affiliation:
School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, China
*
*Corresponding author. Email addresses:liaold15@lzu.edu.cn (L.D. Liao), gf_zhang@lzu.edu.cn (G.F. Zhang)
*Corresponding author. Email addresses:liaold15@lzu.edu.cn (L.D. Liao), gf_zhang@lzu.edu.cn (G.F. Zhang)

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We discuss an efficient preconditioner and iterative numerical method to solve large complex linear algebraic systems of the form (W + iT)u = c, where W and T are symmetric matrices, and at least one of them is nonsingular. When the real part W is dominantly stronger or weaker than the imaginary part T, we propose a block multiplicative (BM) preconditioner or its variant (VBM), respectively. The BM and VBM preconditioned iteration methods are shown to be parameter-free, in terms of eigenvalue distributions of the preconditioned matrix. Furthermore, when the relationship between W and T is obscure, we propose a new preconditioned BM method (PBM) to overcome this difficulty. Both convergent properties of these new iteration methods and spectral properties of the corresponding preconditioned matrices are discussed. The optimal value of iteration parameter for the PBM method is determined. Numerical experiments involving the Helmholtz equation and some other applications show the effectiveness and robustness of the proposed preconditioners and corresponding iterative methods.

Keywords

Preconditionercomplex linear algebraic systemsKrylov subspace methodspectral propertiesconvergence

MSC classification

Secondary:15A06: Linear equations65F10: Iterative methods for linear systems65H10: Systems of equations

Information

Type
Research Article
Information
East Asian Journal on Applied Mathematics , Volume 7 , Issue 3 , August 2017, pp. 530 - 547
Copyright
Copyright © Global-Science Press 2017 

References

[1] Axelsson, O., Iterative Solution Methods, Cambridge University Press (1994).CrossRefGoogle Scholar
[2] Axelsson, O. and Kucherov, A., Real valued iterative methods for solving complex symmetric linear systems, Numer. Linear Algebra Appl. 7, 197–218 (2000).Google Scholar
[3] Axelsson, O., Neytcheva, M. and Ahmad, B., A comparison of iterative methods to solve complex valued linear systems, Numer. Algor. 66, 811–841 (2014).Google Scholar
[4] Bai, Z.Z., Structured preconditioners for nonsingular matrices of block two-by-two structures, Math. Comput. 75, 791–815 (2006).CrossRefGoogle Scholar
[5] Bai, Z.Z., Benzi, M. and Chen, F., Modified HSS iteration methods for a class of complex symmetric linear systems, Computing 87, 93–111 (2010).CrossRefGoogle Scholar
[6] Bai, Z.Z. and Golub, G.H., Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems, IMA J. Numer Anal. 27, 1–23 (2007).Google Scholar
[7] Bai, Z.Z., Benzi, M. and Chen, F., On preconditioned MHSS iteration methods for complex symmetric linear systems, Numer. Algor. 56, 297–317 (2011).CrossRefGoogle Scholar
[8] Bai, Z.Z., Benzi, M. and Chen, F., Preconditioned MHSS iteration methods for a class of block two-by-two linear systems with applications to distributed control problems, IMA J. Numer. Anal. 33, 343–369 (2013).Google Scholar
[9] Bai, Z.Z., Golub, G.H. and Pan, J.Y., Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems, Numer. Math. 98, 1–32 (2004).Google Scholar
[10] Benzi, M., Golub, G.H. and Liesen, J., Numerical solution of saddle point problems, Acta Numer. 14, 1–137 (2005).Google Scholar
[11] Benzi, M. and Bertaccini, D., Block preconditioning of real-valued iterative algorithms for complex linear systems, IMA J. Numer. Anal. 28, 598–618 (2008).Google Scholar
[12] Cao, Y. and Ren, Z.R., Two variants of the PMHSS iteration method for a class of complex symmetric indefinite linear systems, Appl. Math. Comput. 264, 61–71 (2015).Google Scholar
[13] Betts, J.T., Practical Methods for Optimal Control using Nonlinear Programming, SIAM, Philadelphia (2001).Google Scholar
[14] Dijk, W.V., Toyama, F.M., Accurate numerical solutions of the time-dependent Schrödinger equation, Phys. Rev. 75, 1–10 (2007).Google Scholar
[15] Day, D. and Heroux, M.A., Solving Complex-Valued Linear Systems via Equivalent Real Formulations, SIAM J. Sci. Comput. 23(2), 480–498 (2002).Google Scholar
[16] Feriani, A., Perotti, F. and Simoncini, V., Iterative system solvers for the frequency analysis of linear mechanical systems, Comput. Methods Appl. Mech. Engg. 190, 1719–1739 (2000).Google Scholar
[17] Freund, R.W., Conjugate gradient-type methods for linear systems with complex symmetric coefficient matrices, SIAM J. Sci. Stat. Comput. 13, 425–448 (1992).Google Scholar
[18] Freund, R.W., Nachtigal NM QMR: a quasi-minimal residual method for non-Hermitian linear systems, Numer. Math. 60, 315–339 (1991).CrossRefGoogle Scholar
[19] Freund, R.W., A transpose-free quasi-minimum residual algorithm for non-Hermitian linear systems, SIAM. J. Sci. Comput. 14, 470–482 (1993).Google Scholar
[20] Frommer, A., Lippert, T., Medeke, B. and Schilling, K., Numerical Challenges in Lattice Quantum Chromodynamics, Springer-Verlag, Berlin, 43(5-6):1105–1115 (2000).Google Scholar
[21] Hezari, D., Edalatpour, V. and Salkuyeh, D.K., Preconditioned GSOR iterative method for a class of complex symmetric system of linear equations, Numer. Linear Algebra Appl. 22, 761–776 (2015).Google Scholar
[22] Lass, O., Vallejos, M., Borzi, A. and Douglas, C.C., Implementation and analysis of multigrid schemes with finite elements for elliptic optimal control problems, Computing 84, 27–48 (2009).Google Scholar
[23] Lang, C. and Ren, Z.R., Rotated block triangular preconditioners for a class of block two-by-two matrices, J. Eng. Math. 93, 87–98 (2015).CrossRefGoogle Scholar
[24] Liang, Z.Z. and Zhang, G.F., On SSOR iteration method for a class of block two-by-two linear systems, Numer. Algor. 71, 655–671 (2016).CrossRefGoogle Scholar
[25] Saad, Y. and Schultz, M.H., GMRES: a generalized minimal residual algorithm for solving non-symmetric linear algebraic systems, SIAM J. Sci. Stat. Comput. 7, 856–869 (1986).Google Scholar
[26] Saad, Y., Iterative Methods for Sparse Linear Systems, SIAM, Philadelphia (2003)CrossRefGoogle Scholar
[27] Salkuyeh, D.K., Hezari, D. and Edalatpour, V., Generalized SOR iterative method for a class of complex symmetric linear algebraic system of equations, Int. J. Comput. Math. 92, 802–815 (2015).Google Scholar
[28] Sommerfeld, A., Partial Differential Equations, Academic Press. New York (1949).Google Scholar
[29] Xu, W.W., A generalization of preconditioned MHSS iteration method for complex symmetric indefinite linear algebraic systems, Appl. Math. Comput. 219, 10510–10517 (2013).Google Scholar
[30] Zhang, G.F. and Zheng, Z., A parameterized splitting iteration method for complex symmetric linear systems, Jpn. J. Ind. Appl. Math. 31, 265–278 (2014).Google Scholar