Abstract
A modified relaxation two-sweep modulus-based matrix splitting iteration method is proposed by using relaxation techniques and the two-sweep scheme for the solution of implicit complementarity problems. The sufficient conditions for convergence of the proposed method are established when the coefficient matrix is a positive definite matrix and an H+-matrix, respectively. Numerical experiments are presented to show the efficiency of the proposed method, which is superior to the modified modulus-based matrix splitting iteration method in terms of the number of iteration steps and the elapsed CPU time.
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.
