Abstract

The MRTR method has been recognized as an effective iterative method for singular systems of linear equations. The MRTR method is based on the three-term recurrence formula of the CG method and the algorithm is proven to be mathematically equivalent to the CR method. This paper will describe the algorithm of the cs_MRTR method for solving complex symmetric linear systems, and prove that this method is mathematically equivalent to the COCR method. Numerical experiments indicate that the cs_MRTR method convergences more stably compared with the COCR 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 call

Disclaimer: 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.