To solve the large sparse complex symmetric linear equations more efficiently, we introduce a new matrix \(H_\omega =W+\omega T\) and establish two quasi-combining real and imaginary parts iteration methods, which will be simply called the QCRI1 and QCRI2 iteration methods. We give the upper bounds of the spectral radiuses of the two methods and discuss their convergence conditions that make these upper bounds less than 1. In addition, the theoretical quasi-optimal parameters minimizing the upper bound of the spectral radius of the iteration matrix of the QCRI1 method are presented. Meanwhile, the inexact versions of the proposed methods are also provided, and their convergence properties are given. Finally, numerical results illustrate the effectiveness of our methods.
