Abstract
In this paper, we present an (m+1)-step iterative method of convergence order (m+2) for solving linear complementarity problems. The proposed iterative method is simple and easy to construct, and requiring only third Frechet differentiation. Computational efficiency in its general form is discussed and a comparison between the efficiency of the proposed method and existing ones is made. The performance is tested through numerical experiments on some test problems.
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.
