Skip to main content
Log in

Accelerated PMHSS iteration methods for complex symmetric linear systems

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

In this paper, we introduce and analyze an accelerated preconditioning modification of the Hermitian and skew-Hermitian splitting (APMHSS) iteration method for solving a broad class of complex symmetric linear systems. This accelerated PMHSS algorithm involves two iteration parameters α,β and two preconditioned matrices whose special choices can recover the known PMHSS (preconditioned modification of the Hermitian and skew-Hermitian splitting) iteration method which includes the MHSS method, as well as yield new ones. The convergence theory of this class of APMHSS iteration methods is established under suitable conditions. Each iteration of this method requires the solution of two linear systems with real symmetric positive definite coefficient matrices. Theoretical analyses show that the upper bound σ 1(α,β) of the asymptotic convergence rate of the APMHSS method is smaller than that of the PMHSS iteration method. This implies that the APMHSS method may converge faster than the PMHSS method. Numerical experiments on a few model problems are presented to illustrate the theoretical results and examine the numerical effectiveness of the new method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Arridge, S.R.: Optical tomography in medical imaging. Inverse Probl. 15, 41–93 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Axelsson, O., Kucherov, A.: Real valued iterative methods for solving complex symmetric linear systems. Numer. Linear Algebra Appl. 7, 197–218 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bai, Z.-Z.: Block preconditioners for elliptic PDE-constrained optimization problems. Computing 91, 379–395 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bai, Z.-Z.: Structured preconditioners for nonsingular matrices of block two-by-two structures. Math. Comput. 75, 791–815 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bai, Z.-Z., Benzi, M., Chen, F.: Modified HSS iteration methods for a class of complex symmetric linear systems. Computing 87, 93–111 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bai, Z.-Z., Benzi, M., Chen, F.: On preconditioned MHSS iteration methods for complex symmetric linear systems. Numer. Algor. 56, 297–317 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bai, Z.-Z., Benzi, M., Chen, F., Wang, Z.-Q.: 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)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bai, Z.-Z., Golub, G.H.: Accelerated Hermitian skew-Hermitian splitting iteration methods for saddle-point problems. IMA J. Numer Anal. 27, 1–23 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bai, Z.-Z., Golub, G.H., Li, C.-K.: Convergence properties of preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite matrices. Math. Comput. 76, 287–298 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bai, Z.-Z., Golub, G.H., Ng, M.K.: Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. SIAMv J. Matrix Anal. Appl. 24, 603–626 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bai, Z.-Z., Golub, G.H., Ng, M.K.: On successive-overrelaxation acceleration of the Hermitian and skew-Hermitian splitting iterations. Numer. Linear Algebra Appl. 14, 319–335 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Bai, Z.-Z., Golub, G.H., Pan, J.-Y.: Preconditioned Hermitian skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems. Numer. Math. 98, 1–32 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Bendali, A.: Numerical analysis of the exterior boundary value problem for the time-harmonic Maxwell equations by a boundary finite element method. Math. Comput. 43(167), 29–68 (1984)

    MathSciNet  MATH  Google Scholar 

  14. Benzi, M., Bertaccini, D.: Block preconditioning of real-valued iterative algorithms for complex linear systems. IMA J. Numer. Anal. 28, 598–618 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Benzi, M., Golub, G.H.: A preconditioner for generalized saddle point problems. SIAM J. Matrix Anal. Appl. 26, 20–41 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Benzi, M., Golub, G.H., Liesen, J.: Numerical solution of saddle point problems. Acta Numerica 14, 1–137 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Bertaccini, D.: Efficient solvers for sequences of complex symmetric linear systems. Electr. Trans. Numer. Anal. 18, 49–64 (2004)

    MathSciNet  MATH  Google Scholar 

  18. Bunse-Gerstner, A., Stfiver, R.: On a conjugate gradient-type method for solving complex symmetric linear systems. Lin. Alg. Appl. 287, 105–123 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  19. Christiansen, S.H.: Discrete Fredholm properties convergence estimates for the electric field integral equation. Math. Comput. 73(245), 143–167 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  20. Clemens, M., Weiland, T.: Iterative methods for the solution of very large complex symmetric linear systems of equations in electrodynamics, Technische Hochschule Darmstadt (2002)

  21. Clemens, M., Weiland, T.: Comparison of Krylov-type methods for complex linear systems applied to high-voltage problems. IEEE Trans. Mag. 34(5), 3335–3338 (1998)

    Article  Google Scholar 

  22. Day, D.D., Heroux, M.A.: Solving complex-valued linear systems via equivalent real formulations. SIAM J. Sci. Comput. 23, 480–498 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  23. Feriani, A., Perotti, F., Simoncini, V.: Iterative system solvers for the frequency analysis of linear mechanical systems. Comput. Methods Appl. Mech. Eng. 190, 1719–1739 (2000)

    Article  MATH  Google Scholar 

  24. Fletcher, R.: Conjugate gradient methods for indefinite systems, Lecture Notes in Mathematics, vol. 506, pp 73–89. Springer, Berlin (1976)

  25. Freund, R.W.: Conjugate gradient-type methods for linear systems with complex symmetric coefficient matrices. SIAM J. Sci. Statist. Comput. 13, 425C448 (1992)

    Article  MathSciNet  Google Scholar 

  26. Frommer, A., Lippert, T., Medeke, B., Schilling, K.: Numerical Challenges in Lattice Quantum Chromodynamics. Springer, Heidelberg (2000)

    Book  MATH  Google Scholar 

  27. Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  28. Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards 49, 409–436 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  29. Lass, O., Vallejos, M., Borzi, A., Douglas, C.C.: Implementation and analysis of multigrid schemes with finite elements for elliptic optimal control problems. Computing 84, 27–48 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  30. Lions, J.L.: Optimal Control of Systems Governed by Partial Differential Equations. Springer, Berlin (1968)

    Google Scholar 

  31. Li, W., Liu, Y.-P., Peng, X.-F.: The generalized HSS method for solving singualar linear systems. J. Comput. Appl. Math. 236, 2338–2353 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  32. Poirier, B.: Efficient preconditioning scheme for block partitioned matrices with structured sparsity. Numer. Linear Algebra Appl. 7, 715–726 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  33. Rees, T., Dollar, H.S., Wathen, A.J.: Optimal solvers for PDE-constrained optimization. SIAM J. Sci. Comput. 32, 271–298 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  34. Rees, T., Stoll, M.: Block-triangular preconditioners for PDE-constrained optimization. Numer. Linear Algebra Appl. 17, 977–996 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  35. Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)

    Book  MATH  Google Scholar 

  36. Sogabe, T., Zhang, S.-L.: A COCR method for solving complex symmetric linear systems. J. Comput. Appl. MATH. 199, 297–303 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  37. van der Vorst, H.A., Melissen, J.B.M.: A Petrov-Galerkin type method for solving A x = b, where A is symmetric complex. IEEE Trans. Mag. 26(2), 706–708 (1990)

    Article  Google Scholar 

  38. Varga, R.S.: Matrix iterative analysis. Prentice-Hall, englewood cliffs (1962)

  39. Yang, A.-L., An, J., Wu, Y.-J.: A generalized preconditioned HSS Method for non-Hermitian positive definite linear systems. Appl. Math. Comput. 216, 1715–1722 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  40. Yin, J.-F., Dou, Q.-Y.: Generalized preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive-definite linear systems. J. Comput. Math. 30, 404–417 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  41. Young, D.M.: Iterative Solutions of Large Linear Systems. Academic Press, New York (1971)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chang-Feng Ma.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zheng, QQ., Ma, CF. Accelerated PMHSS iteration methods for complex symmetric linear systems. Numer Algor 73, 501–516 (2016). https://doi.org/10.1007/s11075-016-0105-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-016-0105-z

Keywords

Mathematics Subject Classification (2010)

Navigation