New Relaxation Modulus Based Iterative Method for Large and Sparse Implicit Complementarity Problem
Optimization and Control
2023-06-07 v1
Abstract
This article presents a class of new relaxation modulus-based iterative methods to process the large and sparse implicit complementarity problem (ICP). Using two positive diagonal matrices, we formulate a fixed-point equation and prove that it is equivalent to ICP. Also, we provide sufficient convergence conditions for the proposed methods when the system matrix is a -matrix or an -matrix. Keyword: Implicit complementarity problem, -matrix, -matrix, matrix splitting, convergence
Cite
@article{arxiv.2306.03563,
title = {New Relaxation Modulus Based Iterative Method for Large and Sparse Implicit Complementarity Problem},
author = {Bharat Kumar and Deepmala and A. K. Das},
journal= {arXiv preprint arXiv:2306.03563},
year = {2023}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2303.12519