4 papers
New Relaxation Modulus Based Iterative Method for Large and Sparse Implicit Complementarity Problem
Bharat Kumar, Deepmala, A. K. Das
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…
More on Projected Type Iteration Method and Linear Complementarity Problem
Bharat Kumar, Deepmala, A. K. Das
In this article, we establish a class of new projected type iteration methods based on matrix spitting for solving the linear complementarity problem. Also, we provide a sufficient…
New Accelerated Modulus-Based Iteration Method for Solving Large and Sparse Linear Complementarity Problem
Bharat Kumar, Deepmala, A. K. Das
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,…
Error Bound for the Linear Complementarity Problem using Plus Function
Bharat Kumar, Deepmala, A. Dutta +1
In this article we establish error bound for linear complementarity problem with -matrix using plus function. We introduce a fundamental quantity associated with a -matrix an…