Nonstationary relaxed multisplitting methods for solving linear complementarity problems with H-matrices
arXiv:1803.02541h-index: 46
AI Analysis
Provides new iterative solvers for a class of linear complementarity problems, but the contribution is incremental as it extends existing multisplitting techniques.
The authors developed nonstationary relaxed multisplitting methods for linear complementarity problems with H-matrices, proving convergence and demonstrating efficiency through numerical tests.
In this paper we consider some non-stationary relaxed synchronous and asynchronous multi-splitting methods for solving the linear complementarity problems with their coefficient matrices being H-matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests.