Generalized AOR Algorithms for Linear Complementarity Problem
In this paper, we propose a class of generalized accelerated overrelaxation (GAOR) methods, in which one special case reduces to the generalized successive overrelaxation(GSOR) methods, for solving a linear complementarity problem LCP ( M, q ). Sufficient conditions for convergence of the GAOR and G...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2007-06-01
|
Series: | Journal of Algorithms & Computational Technology |
Online Access: | https://doi.org/10.1260/174830107781389030 |