Log in

A new iterative method for solving a class of complex symmetric system of linear equations

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

Abstract

We present a new stationary iterative method, called Scale-Splitting (SCSP) method, and investigate its convergence properties. The SCSP method naturally results in a simple matrix splitting preconditioner, called SCSP-preconditioner, for the original linear system. Some numerical comparisons are presented between the SCSP-preconditioner and several available block preconditioners, such as PGSOR (Hezari et al. Numer. Linear Algebra Appl. 22, 761–776, 2015) and rotate block triangular preconditioners (Bai Sci. China Math. 56, 2523–2538, 2013), when they are applied to expedite the convergence rate of Krylov subspace iteration methods for solving the original complex system and its block real formulation, respectively. Numerical experiments show that the SCSP-preconditioner can compete with PGSOR-preconditioner and even more effective than the rotate block triangular preconditioners.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Hiptmair, R.: Finite elements in computational electromagnetism. Acta Numer. 11, 237–339 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. van Rienen, U.: Numerical Methods in Computational Electrodynamics: Linear Systems in Practical Applications. Springer, Berlin (2001)

    Book  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  4. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Dijk, W.V., Toyama, F.M.: Accurate numerical solutions of the time-dependent Schrödinger equation. Phys. Rev. E 75, 1–10 (2007)

    Google Scholar 

  7. 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 

  8. 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 

  9. 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)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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 

  11. 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 

  12. Li, X., Yang, A.L., Wu, Y.J.: Lopsided PMHSS iteration method for a class of complex symmetric linear systems. Numer. Algor. 66, 555–568 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  13. 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, 706–708 (1990)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. 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 

  16. Gu, X. M., Clemens, M., Huang, T.Z., Li, L.: The SCBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems. Comput. Phys. Commun. 191, 52–64 (2015)

    Article  MATH  Google Scholar 

  17. Gu, X.M., Huang, T.Z., Li, L., Li, H.-B., Sogabe, T., Clemens, M.: Quasi-minimal residual variants of the COCG and COCR methods for complex symmetric linear systems in electromagnetic simulations. IEEE Trans. Microw. Theory Technol. 62, 2859–2867 (2014)

    Article  Google Scholar 

  18. Bai, Z.Z., Benzi, M., 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)

    Article  MathSciNet  MATH  Google Scholar 

  19. Salkuyeh, D.K., Hezari, D., Edalatpour, V.: Generalized SOR iterative method for a class of complex symmetric linear system of equations. Int. J. Comput. Math. 92, 802–815 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  20. Bai, Z.Z.: On preconditioned iteration methods for complex linear systems. J. Eng. Math. 93, 41–60 (2015)

    Article  MathSciNet  Google Scholar 

  21. Bai, Z.Z., Chen, F., Wang, Z.Q.: Additive block diagonal preconditioning for block two-by-two linear systems of skew-Hamiltonian coefficient matrices. Numer. Algorithm 64, 655–675 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  22. Bai, Z.Z.: Rotated block triangular preconditioning based on PMHSS. Sci. China Math. 56, 2523–2538 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  23. Lang, C., Ren, Z.-R.: Inexact rotated block triangular preconditioners for a class of block two-by-two matrices. J. Eng. Math. 93, 87–98 (2015)

    Article  MathSciNet  Google Scholar 

  24. Hezari, D., Edalatpour, V., Salkuyeh, D.K.: Preconditioned GSOR iteration method for a class of complex symmetric linear system. Numer. Linear Algebra Appl. 22, 761–776 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  25. Saad, Y., Schultz, M.H.: GMRES: a generalized minimal residual algorithm for nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7, 856–869 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  26. 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 

  27. Bai, Z.Z., Ng, M.K.: On inexact preconditioners for nonsymmetric matrices. SIAM J. Sci. Comput. 26, 1710–1724 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  28. Zhang, J., Dai, H.: A new splitting preconditioner for the iterative solution of complex symmetric indefinite linear systems. Appl. Math. Lett. 49, 100–106 (2015)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Davod Hezari.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hezari, D., Salkuyeh, D.K. & Edalatpour, V. A new iterative method for solving a class of complex symmetric system of linear equations. Numer Algor 73, 927–955 (2016). https://doi.org/10.1007/s11075-016-0123-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-016-0123-x

Keywords

Mathematics Subject Classification (2010)

Navigation