Abstract
Recently, Axelsson et al. proposed the so called C-to-R method to solve the complex symmetric definite linear systems (see Axelsson et al., Numer Algor. 2014;66:811–841). In this paper, a generalized C-to-R (GCTR) iterative method is presented for solving the complex symmetric indefinite linear system. The convergent analysis of GCTR method is given, which shows the GCTR method is convergent under the assumptions of and has smaller convergence factor than some existing methods. This GCTR method also can result in an efficient preconditioner, which also has tighter clustering than some existing preconditioners. Numerical results are presented, which show full robustness and effectiveness of our proposed method.
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.
