LAUSR

Accelerated double-step scale splitting (ADSS) approach is an efficient and fast method for solving a class of large complex symmetric linear equations which has been recently presented by parameterized DSS method. In this paper, we will apply ADSS scheme for solving complex Sylvester matrix equation. It will be proved analytically that the ADSS iteration method is faster than the DSS iteration method. Moreover, we minimize the upper bound of the spectral radius of iteration matrix. Finally, some test problems will be given and results will be reported to support the theoretical claims.