New Accelerated Modulus-Based Iteration Method for Solving Large and Sparse Linear Complementarity Problem

Abstract

In this article, we establish a class of new accelerated modulus-based iteration methods for solving the linear complementarity problem. When the system matrix is an H+-matrix, we present appropriate criteria for the convergence analysis. Also, we demonstrate the effectiveness of our proposed method and reduce the number of iterations and CPU time to accelerate the convergence performance by providing two numerical examples for various parameters. Keywords. Linear complementarity problem, Iteration method, P-matrix, H+-matrix, Convergence analysis, Matrix splitting.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…