Abstract
Implicit complementarity problems (ICPs) have attracted a great deal of attention in recent years. To this end, fast modulus-based matrix splitting iteration methods for ICPs are studied in this paper. We first reformulate the ICP as a fixed-point equation. Then we propose our fast methods and prove the convergence under some assumptions. By suitably adopting the relations between the solutions of the ICP and the equivalent one, computation cost of the proposed methods is reduced compared with some existing methods. This advantage is verified by numerical experiments, which illustrate that our methods are much more practical in applications.
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.
