In this paper, we present an efficient method for finding a numerical solution for nonlinear complementarity problems (NCPs). We first reformulate an NCP as an equivalent system of fixed-point equations and then present a modulus-based matrix splitting iteration method. We prove the convergence of the proposed method with theorems with the relevant conditions. Our preliminary numerical results show that the method is feasible and effective.
In this paper, we construct two-step tensor splitting iteration method for multi-linear systems. Moreover, we present convergence analysis of this method. Finally, we give two numerical examples to show that this new method is more ecient than the existing methods.
Abstract
In this paper, based on the shift splitting technique, a shift
splitting (SS) iteration method is presented to solve the
generalized absolute value equations. Convergence conditions of the
SS method are discussed in detail when the involved matrices are
some special matrices. Finally, numerical experiments show the
effectiveness of the proposed method.
An Efficient Class of Modulus-Based Matrix Splitting Methods for Nonlinear Complementarity Problems
