- Journal Home
- Volume 41 - 2025
- Volume 40 - 2024
- Volume 39 - 2023
- Volume 38 - 2022
- Volume 37 - 2021
- Volume 36 - 2020
- Volume 35 - 2019
- Volume 34 - 2018
- Volume 33 - 2017
- Volume 32 - 2016
- Volume 31 - 2015
- Volume 30 - 2014
- Volume 29 - 2013
- Volume 28 - 2012
- Volume 27 - 2011
- Volume 26 - 2010
- Volume 25 - 2009
Cited by
- BibTex
- RIS
- TXT
Recently, inspired by a modified generalized shift-splitting iteration method for complex symmetric linear systems, we propose two variants of the modified generalized shift-splitting iteration (MGSS) methods for solving complex symmetric linear systems. One is a parameterized MGSS iteration method and the other is a modified parameterized MGSS iteration method. We prove that the proposed methods are convergent under appropriate constraints on the parameters. In addition, we also give the eigenvalue distributions of different preconditioned matrices to verify the effectiveness of the preconditioners proposed in this paper.
}, issn = {2707-8523}, doi = {https://doi.org/10.4208/cmr.2025-0017}, url = {http://global-sci.org/intro/article_detail/cmr/24190.html} }Recently, inspired by a modified generalized shift-splitting iteration method for complex symmetric linear systems, we propose two variants of the modified generalized shift-splitting iteration (MGSS) methods for solving complex symmetric linear systems. One is a parameterized MGSS iteration method and the other is a modified parameterized MGSS iteration method. We prove that the proposed methods are convergent under appropriate constraints on the parameters. In addition, we also give the eigenvalue distributions of different preconditioned matrices to verify the effectiveness of the preconditioners proposed in this paper.