A class of generalized multisplitting relaxation methods for linear complementarity problems
Two generalized parallel multisplitting relaxation methods for solving a linear complementarity problem (LCP) \(x^+=Mx^-+q\) are described. The sequences generated by the methods are proved to converge to the unique solution of the LCP provided \(M\) is a \(H\)-matrix with positive diagonal elements.
scientific article; zbMATH DE number 1193546