摘要
Abstract In this paper,a class of generalized parallel matrix multisplitting relaxation methods for solving linear complementarity problems on the high speed multiprocessor systems is set up.This class of methods not only includes all the existing relaxation methods for the linear complementarity problems,but also yields a lot of novel ones in the sense of multisplitting.We establish the convergence theories of this class of generalized parallel multisplitting relaxation methods under the condition that the system matrix is an H matrix with positive diagonal elements.
Abstract In this paper,a class of generalized parallel matrix multisplitting relaxation methods for solving linear complementarity problems on the high speed multiprocessor systems is set up.This class of methods not only includes all the existing relaxation methods for the linear complementarity problems,but also yields a lot of novel ones in the sense of multisplitting.We establish the convergence theories of this class of generalized parallel multisplitting relaxation methods under the condition that the system matrix is an H matrix with positive diagonal elements.