Abstract
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.
Sign-in/Register to access full text options 
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.
