In this paper, we obtain a new equivalent fixed-point form of the linear complementarity problem by introducing a relaxed matrix and establish a class of relaxed modulus-based matrix splitting iteration methods for solving the linear complementarity problem. Some sufficient conditions for guaranteeing the convergence of relaxed modulus-based matrix splitting iteration methods are presented. Numerical examples are offered to show the efficacy of the proposed methods.
AbstractWe construct modulus-based synchronous multisplitting iteration methods to solve a large implicit complementarity problem on parallel multiprocessor systems, and prove their convergence. Numerical results confirm our theoretical analysis and show that these new methods are efficient.
Efficient numerical methods for pricing American options using Heston's stochastic volatility model are proposed. Based on this model the price of a European option can be obtained by solving a two-dimensional parabolic partial differential equation. For an American option the early exercise possibility leads to a lower bound for the price of the option. This price can be computed by solving a linear complementarity problem. The idea of operator splitting methods is to divide each time step into fractional time steps with simpler operators. This paper proposes componentwise splitting methods for solving the linear complementarity problem. The basic componentwise splitting decomposes the discretized problem into three linear complementarity problems with tridiagonal matrices. These problems can be efficiently solved using the Brennan and Schwartz algorithm, which was originally introduced for American options under the Black and Scholes model. The accuracy of the componentwise splitting method is increased by applying the Strang symmetrization. The good accuracy and the computational efficiency of the proposed symmetrized splitting method are demonstrated by numerical experiments.
The modulus-based matrix splitting iteration has received substantial
attention as a momentous tool for complementarity problems. For the purpose
of solving the horizontal linear complementarity problem, we introduce the
two-step modulus-based matrix splitting iteration method. We also show the
theoretical analysis of the convergence. Numerical experiments illustrate
the effectiveness of the proposed approach.
A class of new modulus-based matrix splitting methods for linear complementarity problem
