Abstract
For the large sparse complex symmetric linear systems, based on the combination method of real part and imaginary part method established by Wang et al. (J Comput Appl Math 325:188–197, 2017) and the double-step scale splitting one derived by Zheng et al. (Appl Math Lett 73:91–97, 2017), we construct a modified two-step scale-splitting (MTSS) iteration method in this paper. The convergence properties of the MTSS iteration method and its quasi-optimal parameters which minimizes the upper bound for the spectral radius of the proposed method are presented. Meanwhile, we derive the inexact variant of the MTSS iteration method. On this basis, we also introduce a minimum residual MTSS iteration method and its inexact version and give their convergence analyses. Numerical results on complex symmetric linear systems support that the proposed methods are more efficient and robust than some other commonly used ones.
Similar content being viewed by others
References
Axelsson O, Kucherov A (2000) Real valued iterative methods for solving complex symmetric linear systems. Numer Linear Algebra Appl 7:197–218
Axelsson O, Neytcheva M, Ahmad B (2014) A comparison of iterative methods to solve complex valued linear algebraic systems. Numer Algorithms 66:811–841
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 (2000) Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems. Appl Math Comput 109:273–285
Bai Z-Z (2003) On the convergence of additive and multiplicative splitting iterations for systems of linear equations. J Comput Appl Math 154:195–214
Bai Z-Z (2015) Motivations and realizations of Krylov subspace methods for large sparse linear systems. J Comput Appl Math 283:71–78
Bai Z-Z (2015) On preconditioned iteration methods for complex linear systems. J Eng Math 93:41–60
Bai Z-Z (2016) On SSOR-like preconditioners for non-Hermitian positive definite matrices. Numer Linear Algebra Appl 23:37–60
Bai Z-Z, Rozloznik M (2015) On the numerical behavior of matrix splitting iteration methods for solving linear systems. SIAM J Numer Anal 53:1716–1737
Bai Z-Z, Wang Z-Q (2008) On parameterized inexact Uzawa methods for generalized saddle point problems. Linear Algebra Appl 428:2900–2932
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
Bai Z-Z, Parlett BN, Wang Z-Q (2005) On generalized successive overrelaxation methods for augmented linear systems. Numer Math 102:1–38
Bai Z-Z, Golub GH, Ng MK (2008) On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. Linear Algebra Appl 428:413–440
Bai Z-Z, Benzi M, Chen F (2010) Modified HSS iteration methods for a class of complex symmetric linear systems. Computing 87:93–111
Bai Z-Z, Benzi M, Chen F (2011) On preconditioned MHSS iteration methods for complex symmetric linear systems. Numer Algorithms 56:297–317
Bai Z-Z, Benzi M, Chen F, Wang Z-Q (2013) 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
Benzi M, Golub GH, Liesen J (2005) Numerical solution of saddle point problems. Acta Numer 14:1–137
Bertaccini D (2004) Efficient solvers for sequences of complex symmetric linear systems. Electron Trans Numer Anal 18:49–64
Hezari D, Edalatpour V, Salkuyeh DK (2015) Preconditioned GSOR iterative method for a class of complex symmetric system of linear equations. Numer. Linear Algebra Appl. 22:761–776
Hezari D, Salkuyeh DK, Edalatpour V (2016) A new iterative method for solving a class of complex symmetric system of linear equations. Numer Algorithms 73:927–955
Huang Z-G (2020) A new double-step splitting iteration method for certain block two-by-two linear systems. Comput Appl Math 39:193
Huang Z-G, Wang L-G, Xu Z, Cui J-J (2018) An efficient two-step iterative method for solving a class of complex symmetric linear systems. Comput Math Appl 75:2473–2498
Huang Z-G, Wang L-G, Xu Z, Cui J-J (2019) Preconditioned accelerated generalized successive overrelaxation method for solving complex symmetric linear systems. Comput Math Appl 77:1902–1916
Huang Z-G, Xu Z, Cui J-J (2019) Preconditioned triangular splitting iteration method for a class of complex symmetric linear systems. Calcolo 56:22
Li X, Yang A-L, Wu Y-J (2014) Lopsided PMHSS iteration method for a class of complex symmetric linear systems. Numer Algorithms 66:555–568
Liao L-D, Zhang G-F, Wang X (2020) Extrapolation accelerated PRESB method for solving a class of block two-by-two linear systems. East Asian J Appl Math 10:520–531
Saad Y (2003) Iterative methods for sparse linear systems. SIAM, Philadelphia
Salkuyeh DK (2017) Two-step scale-splitting method for solving complex symmetric system of linear equations. [math.NA]. arXiv:1705.02468
Salkuyeh DK, Siahkolaei TS (2018) Two-parameter TSCSP method for solving complex symmetric system of linear equations. Calcolo 55:8
Salkuyeh DK, Hezari D, Edalatpour V (2015) Generalized SOR iterative method for a class of complex symmetric linear system of equations. Int J Comput Math 92:802–815
Siahkolaei TS, Salkuyeh DK (2019) A new double-step method for solving complex Helmholtz equation. Hacet J Math Stat. https://doi.org/10.15672/HJMS.xx
Wang T, Lu L-Z (2016) Alternating-directional PMHSS iteration method for a class of two-by-two block linear systems. Appl Math Lett 58:159–164
Wang T, Zheng Q-Q, Lu L-Z (2017) A new iteration method for a class of complex symmetric linear systems. J Comput Appl Math 325:188–197
Xiao X-Y, Wang X, Yin H-W (2017) Efficient single-step preconditioned HSS iteration methods for complex symmetric linear systems. Comput Math Appl 74:2269–2280
Xiao X-Y, Wang X, Yin H-W (2018) Efficient preconditioned NHSS iteration methods for solving complex symmetric linear systems. Comput Math Appl 75:235–247
Yang A-L (2019) On the convergence of the minimum residual HSS iteration method. Appl Math Lett 94:210–216
Yang A-L, Cao Y, Wu Y-J (2019) Minimum residual Hermitian and skew-Hermitian splitting iteration method for non-Hermitian positive definite linear systems. BIT Numer Math 59:299–319
Zeng M-L, Ma C-F (2016) A parameterized SHSS iteration method for a class of complex symmetric system of linear equations. Comput Math Appl 71:2124–2131
Zhang J-H, Dai H (2017) A new block preconditioner for complex symmetric indefinite linear systems. Numer Algorithms 74:889–903
Zhang W-H, Yang A-L, Wu Y-J (2021) Mninmum residual modified HSS iteration method for a class of complex symmetric linear systems. Numer Algorithms 86:1543–1559
Zheng Q-Q, Lu L-Z (2017) A shift-splitting preconditioner for a class of block two-by-two linear systems. Appl Math Lett 66:54–60
Zheng Z, Huang F-L, Peng Y-C (2017) Double-step scale splitting iteration method for a class of complex symmetric linear systems. Appl Math Lett 73:91–97
Acknowledgements
I would like to express my sincere thanks to the anonymous reviewers for their valuable suggestions and construct comments which greatly improved the presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Zhong-Zhi Bai.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research was supported by the National Natural Science Foundation of China (no. 11901123), the Guangxi Natural Science Foundation (no. 2018JJB110062, 2019AC20062) and the Xiangsihu Young Scholars Innovative Research Team of Guangxi University for Nationalities (no. 2019RSCXSHQN03)
Rights and permissions
About this article
Cite this article
Huang, ZG. Modified two-step scale-splitting iteration method for solving complex symmetric linear systems. Comp. Appl. Math. 40, 122 (2021). https://doi.org/10.1007/s40314-021-01514-6
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-021-01514-6
Keywords
- Complex symmetric linear systems
- Modified two-step scale-splitting iteration method
- Inexact version
- Minimum residual technique
- Convergence analysis