New Accelerated Modulus-Based Iteration Method for Solving Large and Sparse Linear Complementarity Problem
Optimization and Control
2023-05-05 v1
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 -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, -matrix, -matrix, Convergence analysis, Matrix splitting.
Cite
@article{arxiv.2305.02764,
title = {New Accelerated Modulus-Based Iteration Method for Solving Large and Sparse Linear Complementarity Problem},
author = {Bharat Kumar and Deepmala and A. K. Das},
journal= {arXiv preprint arXiv:2305.02764},
year = {2023}
}