PARALLEL CHAOTIC MULTISPLITTING ITERATIVE METHODS FOR THE LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEM

摘要

A parallel chaotic multisplitting method for solving the large sparse linear complemen- tarity problem is presented, and its convergence properties are discussed in detail when the system matrix is either symmetric or nonsymmetric. Moreover, some applicable re- laxed variants of this parallel chaotic multisplitting method together with their convergence properties are investigated. Numerical results show that highly parallel efficiency can be achieved by these new parallel chaotic multisplitting methods.