Abstract
Recently, Chen and Ma [21] constructed the generalized shift-splitting (GSS) preconditioner, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the generalized shift-splitting (GSS) preconditioner, we generalize their algorithms and further study the two-sweep shift-splitting (TSSS) preconditioner for complex symmetric linear systems. Moreover, by similar theoretical analysis, we obtain that the two-sweep shift-splitting iterative method is unconditionally convergent. In finally, one example is provided to confirm the effectiveness.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
