Journal
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
Volume 33, Issue 1, Pages 97-110Publisher
SIAM PUBLICATIONS
DOI: 10.1137/100811222
Keywords
LCP; P-matrices; real positive definite matrices; M-matrices; H+-matrices; strictly diagonally dominant matrices; iterative schemes; scaled extrapolation; (block) modulus algorithm; modulus-based matrix splitting iteration methods; modified AOR method
Categories
Ask authors/readers for more resources
The numerous applications of the linear complementarity problem (LCP) in, e.g., the solution of linear and convex quadratic programming, free boundary value problems of fluid mechanics, and moving boundary value problems of economics make its efficient numerical solution a very imperative and interesting area of research. For the solution of the LCP, many iterative methods have been proposed, especially, when the matrix of the problem is a real positive definite or an H+-matrix. In this work we assume that the real matrix of the LCP is an H-vertical bar - matrix and solve it by using a new method, the scaled extrapolated block modulus algorithm, as well as an improved version of the very recently introduced modulus-based matrix splitting modified AOR iteration method. As is shown by numerical examples, the two new methods are very effective and competitive with each other.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available