A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
For the large sparse linear complementarity problem, by reformulating it as an implicit fixedpoint equation problem, Bai propose a class of modulus-based matrix splitting iteration methods in  . In this paper, we discuss one form of these methods-the general modulus-based Jacobi iteration method, proved the convergence, and derive the domain and the optimum value of the parameter for one special situation. Numerical results show that this method is superior to some modulus-related methodsdoi:10.2298/fil1508821f fatcat:2eeljzhaefgm5k2h6as3ogjccm