Parallel GAOR Algorithms for Linear Complementarity Problem

摘要：

In order to solve a linear complementarity problem LCP(M,q), When M is an n×n nonsingular matrix, a class of generalized AOR (GAOR) methods based on GAOR methods for solving linear system, whose special case reduces generalized SOR(GSOR) methods, is proposed.Some sufficient conditions for convergence of GAOR and GSOR methods are given, when the system matrix M is an H-matrix, M-matrix and a strictly or irreducible diagonally dominant matrix. When M is an L-matrix, their monotone convergence are discussed.

关键词： GAOR methods GSOR methods Linear complementarity problem Convergence Monotone

作者: Dongjin Yuan hui zhang

作者单位: Department of Mathematics YangZhou University, Yangzhou, Jiangsu, China

会议类型: 国际会议

会议名称: 2006 International Symposium on Distributed Computing and Applications to Business,Engineering and Science(2006年国际电子、工程及科学领域的分布式计算应用学术研讨会)

会议地点: 杭州

会议语种:英文

页码: 72-76

在线出版日期: 2006-10-12（万方平台首次上网日期，不代表论文的发表时间）