A parallel algorithm for the linear complementarity problem with an M-matrix

被引：0
|
作者：
Li, L [1 ]
机构：
[1] Hosei Univ, Fac Engn, Koganei, Tokyo 1848584, Japan
来源：
PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4 | 2003年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The linear complementarity problem LCP(A, q) which consists of finding a vector z is an element of R-n such that Az + q greater than or equal to 0, z greater than or equal to 0, z(T) (Az + q) = 0, where A is an element of R-nxn and q is an element of R-n are a given real matrix and an real vector, respectively. This paper proposes an O(n(2)) parallel algorithm (or O(n) parallel algorithm) by using n processors (or n(2) processors) for solving the LCP(A, q) with A is an M-matrix.
引用
收藏
页码：1312 / 1316
页数：5
相关论文
共 50 条
12345