Abstract
In this paper, we consider some relaxed synchronous and asynchronous multisplitting iteration schemes for solving the mixed linear complementarity problems, with the matrix A being H-matrix. We establish some convergence theorems for the methods. Numerical results show that the new methods are efficient and suitable to parallel computing.
Full Text
Published Version
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