Asynchronous multisplitting relaxation methods for linear complementarity problems

From MaRDI portal





To solve linear complementarity problems efficiently on high-speed multiprocessor systems the authors set up a class of asynchronous parallel matrix multisplitting accelerated over-relaxation (AOR) methods by technical combination of the matrix multisplitting and the accelerated overrelaxation technique. The convergence theory of this new method is established under the condition that the system matrix of the linear complementarity problem to be an \(H\)-matrix with positive diagonal elements. At last a multi-parameter extension for this new asynchronous multisplitting AOR method is made, and the convergence property of the resulted asynchronous multisplitting unsymmetric AOR method is investigated. Thereby, an extensive sequence of asynchronous parallel relaxed iteration methods in the sense of multisplitting is presented for solving the large scale linear complementarity problem in the asynchronous parallel computing environments.




Cited in
(19)








This page was built for publication: Asynchronous multisplitting relaxation methods for linear complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243277)