NEW ACCELERATED MODULUS-BASED ITERATION METHOD FOR SOLVING LARGE AND SPARSE LINEAR COMPLEMENTARITY PROBLEM

Authors

Bharat Kumar, Pandit Dwarka Prasad Mishra Indian Institute of Information Technology, Design & Manufacturing Jabalpur
Deepmala, Pandit Dwarka Prasad Mishra Indian Institute of Information Technology, Design & Manufacturing Jabalpur
Arup K. Das, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Journal of Numerical Analysis and Approximation Theory

Abstract

For the large and sparse linear complementarity problem, we provide a family of new accelerated modulus-based iteration methods in this article. We provide some sufficient criteria for the convergence analysis when the system matrix is a P-matrix or an H+-matrix. In addition, we provide some numerical examples of the different parameters to illustrate the efficacy of our proposed methods. These methods help us reduce the number of iterations and the time required by the CPU, which improves convergence performance.

First Page

224

Last Page

235

DOI

10.33993/jnaat531-1370

Publication Date

7-11-2024

Comments

Open Access; Gold Open Access

Recommended Citation

Kumar, Bharat; Deepmala; and Das, Arup K., "NEW ACCELERATED MODULUS-BASED ITERATION METHOD FOR SOLVING LARGE AND SPARSE LINEAR COMPLEMENTARITY PROBLEM" (2024). Journal Articles. 4926.
https://digitalcommons.isical.ac.in/journal-articles/4926