Abstract
In this paper we make two new lopsided methods (LTSCSP1 and LTSCSP2) based on the two-scale-splitting (TSCSP) method and show that the convergence speed of TSCSP iteration method can be increased under some conditions without adding any additional parameter. The convergence analysis of the new methods in detail is given. Then we will obtain the quasi-optimal parameter to minimize the spectral radius of iteration matrix for the new methods. The inexact version of these methods is derived. To illustrate the effectiveness of the proposed framework, several numerical examples are given.
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.
