Fast and Unconditional Convergent MRMHSS Iteration Method for Solving Complex Symmetric Linear Systems

Abstract

Based on the modified Hermitian and skew-Hermitian splitting (MHSS) iteration scheme and a novel minimum residual technique with the aid of a positive definite matrix, a novel minimum residual MHSS (NMRMHSS) iteration method was proposed for solving complex symmetric systems of linear equations. As is known, the NMRMHSS iteration is unconditional convergent; however, its numerical performance is degraded. In this work, we consider to improve the rate of the convergence of the NMRMHSS iteration method and inherit its theoretical property. To the end, we first combine the minimization technique of NMRMHSS with an accelerating method and obtain a fast and unconditional convergent iteration method. Then, the convergence is demonstrated, which indicates that the contraction factor of our method is smaller than that of NMRMHSS. Besides, the theoretical analysis shows that our method has more widespread application for solving complex symmetric linear systems. Finally, numerical results are reported to illustrate the numerical behavior of the proposed iteration method.

Keywords

Complex symmetric matrix / Modified Hermitian and skew-Hermitian splitting (MHSS) / Minimum residual technique / Unconditionally convergent / Symmetric positive semi-definite / 65F10 / 65F50 / 65N22

References

[1] ArridgeSR. Optical tomography in medical imaging. Inverse Probl., 1999, 15(2): R41-R93

[2] AxelssonO, KucherovA. Real valued iterative methods for solving complex symmetric linear systems. Numer. Linear Algebra Appl., 2000, 7(4): 197-218

[3] AxelssonO, NeytchevaM, AhmadB. A comparison of iterative methods to solve complex valued linear algebraic systems. Numer. Algorithms, 2014, 66(4): 811-841

[4] BaiZ-Z. On preconditioned iteration methods for complex linear systems. J. Eng. Math., 2015, 93(1): 41-60

[5] BaiZ-Z. A two-step matrix splitting iteration paradigm based on one single splitting for solving systems of linear equations. Numer. Linear Algebra Appl., 2023.

[6] BaiZ-Z, BenziM, ChenF. Modified HSS iteration methods for a class of complex symmetric linear systems. Computing, 2010, 87: 93-111

[7] BaiZ-Z, BenziM, ChenF. On preconditioned MHSS iteration methods for complex symmetric linear systems. Numer. Algorithms, 2011, 56: 297-317

[8] BaiZ-Z, GolubGH, NgMK. Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. SIAM J. Matrix Anal. Appl., 2003, 24: 603-626

[9] BaiZ-Z, PanJ-YMatrix Analysis and Computations, 2021, Philadelphia. SIAM.

[10] BaiZ-Z, YinJ-F, SuY-F. A shift-splitting preconditioner for non-Hermitian positive definite matrices. J. Comput. Math., 2006, 24: 539-552

[11] BenziM, BertacciniD. Block preconditioning of real-valued iterative algorithms for complex linear systems. IMA J. Numer. Anal., 2010, 28(3): 598-618

[12] BertacciniD. Efficient preconditioning for sequences of parametric complex symmetric linear systems. Electron. Trans. Numer. Anal., 2004, 18(2): 49-64

[13] DijkWV, ToyamaFM. Accurate numerical solutions of the time-dependent Schrödinger equation. Phys. Rev. E, 2007, 753036707

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

[15] FreundRW. Conjugate gradient-type methods for linear systems with complex symmetric coefficient matrices. SIAM J. Sci. Stat. Comput., 1992, 13: 425-448

[16] FreundRW. A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems. SIAM J. Sci. Comput., 1993, 14: 470-482

[17] FreundRW, NachtigalNM. QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math., 1991, 60: 315-339

[18] FreundRW, NachtigalNM. An implementation of the QMR method based on coupled two-term recurrences. SIAM J. Sci. Comput., 1994, 15: 313-337

[19] HezariD, EdalatpourV, SalkuyehDK. Preconditioned GSOR iterative method for a class of complex symmetric system of linear equations. Numer. Linear Algebra Appl., 2015, 22: 761-776

[20] HuangZ-G. Modified two-step scale-splitting iteration method for solving complex symmetric linear systems. Comput. Appl. Math., 2021.

[21] HuangZ-G, WangL-G, XuZ, CuiJ-J. An efficient two-step iterative method for solving a class of complex symmetric linear systems. Comput. Math. Appl., 2018, 75: 2473-2498

[22] HuangZ-G, XuZ, CuiJ-J. Preconditioned triangular splitting iteration method for a class of complex symmetric linear systems. Calcolo, 2019, 5622.

[23] LiJ-T, MaC-F. The parameterized upper and lower triangular splitting methods for saddle point problems. Numer. Algorithms, 2017, 76: 413-425

[24] LiX, YangA-L, WuY-J. Lopsided PMHSS iteration method for a class of complex symmetric linear systems. Numer. Algorithms, 2014, 66: 555-568

[25] LiX-A, ZhangW-H, WuY-J. On symmetric block triangular splitting iteration method for a class of complex symmetric system of linear equations. Appl. Math. Lett., 2018, 79: 131-137

[26] LiaoL-D, ZhangG-F, LiR-X. Optimizing and improving of the C-to-R method for solving complex symmetric linear systems. Appl. Math. Lett., 2018, 82: 70-84

[27] LiaoL-D, ZhangG-F, WangX. Extrapolation accelerated PRESB method for solving a class of block two-by-two linear systems. East Asian J. Appl. Math., 2020, 10: 520-531

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

[29] RenZ-R, CaoY, ZhangL-L. On preconditioned MHSS real-valued iteration methods for a class of complex symmetric indefinite linear systems. East Asian J. Appl. Math., 2016, 6: 192-210

[30] SaadYIterative Methods for Sparse Linear Systems, 20032Philadelphia. SIAM.

[31] SalkuyehDK, HezariD, EdalatpourV. Generalized successive overrelaxation iterative method for a class of complex symmetric linear system of equations. Int. J. Comput. Math., 2015, 92: 802-815

[32] van der Vorst, H.A., Melissen, J.B.M.: A Petrov-Galerkin type method for solving $Ax = b$, where $A$ is symmetric complex. IEEE Trans. Magn. 26, 706–708 (1990)

[33] WangT, LuL-Z. Alternating-directional PMHSS iteration method for a class of two-by-two block linear systems. Appl. Math. Lett., 2016, 58: 159-164

[34] WangT, ZhengQ-Q, LuL-Z. A new iteration method for a class of complex symmetric linear systems. J. Comput. Appl. Math., 2017, 325: 188-197

[35] XiaoX-Y, QiX, ZhaoY-C. Improved CRI iteration methods for a class of complex symmetric linear systems. Calcolo, 2022, 5920.

[36] XieX-F, HuangZ-G, CuiJ-J, LiB-B. Minimum residual two-parameter TSCSP method for solving complex symmetric linear systems. Comput. Appl. Math., 2023.

[37] XiongJ-S. Modified upper and lower triangular splitting iterative method for a class of block two-by-two linear systems. Linear Multilinear Algebra, 2023, 71: 29-40

[38] YangA-L. On the convergence of the minimum residual HSS iteration method. Appl. Math. Lett., 2019, 94: 210-216

[39] YangA-L, CaoY, WuY-J. Minimum residual Hermitian and skew-Hermitian splitting iteration method for non-Hermitian positive definite linear systems. BIT Numer. Math., 2019, 59: 299-319

[40] ZhangJ-H, DaiH. A new iterative method for solving complex symmetric linear systems. Appl. Math. Comput., 2017, 302: 9-20

[41] ZhangJ-H, WangZ-W, ZhaoJ. Preconditioned symmetric block triangular splitting iteration method for a class of complex symmetric linear systems. Appl. Math. Lett., 2018, 86: 95-102

[42] ZhangW-H, YangA-L, WuY-J. Minimum residual modified HSS iteration method for a class of complex symmetric linear systems. Numer. Algorithms, 2021, 86: 1543-1559

[43] ZhangW-H, YangA-L, WuY-J. Novel minimum residual MHSS iteration method for solving complex symmetric linear systems. Appl. Math. Lett., 2024, 148. 108869

[44] ZhengQ-Q, LuL-Z. A shift-splitting preconditioner for a class of block two-by-two linear systems. Appl. Math. Lett., 2016, 66: 54-60

[45] ZhengQ-Q, MaC-F. A class of triangular splitting methods for saddle point problems. J. Comput. Appl. Math., 2016, 298: 13-23

[46] ZhengZ, ZengM-L, ZhangG-F. A variant of PMHSS iteration method for a class of complex symmetric indefinite linear systems. Numer. Algorithms, 2022, 91: 283-300

Funding

National Natural Science Foundation of China(12201272)

Youth Science Foundation of Lanzhou Jiaotong University(1200061132)

RIGHTS & PERMISSIONS

Shanghai University