Abstract
The aim of this paper is to present two classes of multisplitting chaotic relaxation methods for solving the large sparse linear complementarity problem (LCP \((M,q)\)). When the system matrix \(M\) is an \(H\)-matrix with positive diagonal elements, the convergence theorems of the methods are investigated. Also the monotone convergence of the methods is established when \(M\) is an \(L\)-matrix.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
