Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM. J. Matrix Anal. & Appl. 33, pp. 97-110 (14 pages)
On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookThe 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_{+}$-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. (A corrected PDF is attached to this article.)
© 2012 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received October 11, 2010
Accepted October 13, 2011
Published online January 10, 2012
Accepted October 13, 2011
Published online January 10, 2012
Digital Object Identifier
For access to fully linked references, you need to log in.
ALL SIAM Content
Scitation
Google Scholar