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. In this paper, we extend the MRTR method to solve complex symmetric linear systems. We describe this extended cs_MRTR method and prove that this method is mathematically equivalent to the COCR method. Numerical examples show that the cs_MRTR method shows a more stable convergence behavior than the COCR method.(Theory)
