摘要
一类求解系数矩阵为Z矩阵的线性互补问题的高斯旋转变换方法被提出,这类算法的优点在于并行计算以解决大规模科学与工程问题.
A parallel Gassian Pivoting Algorithm for solving linear complementarity problem with Z-matrix is presented in this paper. One of advantages of this algorithm is that it parallelly solves the large scale science and engineer problems.
出处
《湖南城市学院学报（自然科学版）》
CAS
2005年第2期41-42,共2页
Journal of Hunan City University:Natural Science
关键词
线性互补问题
高斯旋转变换
并行计算
Linear complementarity problem
Gassian Pivoting Algorithm
parallel computing
