| GAUSSIAN PIVOTING METHOD FORSOLVING LINEAR COMPLEMENTARITY PROBLEM |
| |
| 引用本文： | L1DONGHUI ZengJinping Zhangzhongzhi. GAUSSIAN PIVOTING METHOD FORSOLVING LINEAR COMPLEMENTARITY PROBLEM[J]. 高校应用数学学报(英文版), 1997, 12(4): 419-426. DOI: 10.1007/s11766-997-0044-5 |
| |
| 作者姓名： | L1DONGHUI ZengJinping Zhangzhongzhi |
| |
| 作者单位： | DepertmentofAppliedMathematics,HunanUniversity,Changsha410082 |
| |
| 摘 要： | In this paper, a new direct algorithm for solving linear complementarity problem with Z-matrix is proposed. The algorithm exhibits either a solution or its nonexistence after at most n steps (where n is the dimension of the problem) and the computational complexity is at most 1/3n^2 O(n^2)
|
| 关 键 词： | 高斯旋转法 线性求补问题 直接法 Z-矩阵 |
| 收稿时间： | 1996-07-18 |
Gaussian pivoting method for solving linear complementarity problem |
| |
| Li Donghui,Zeng Jinping,Zhang Zhongzhi. Gaussian pivoting method for solving linear complementarity problem[J]. Applied Mathematics A Journal of Chinese Universities, 1997, 12(4): 419-426. DOI: 10.1007/s11766-997-0044-5 |
| |
| Authors: | Li Donghui Zeng Jinping Zhang Zhongzhi |
| |
| Affiliation: | (1) Department of Applied Mathematics, Hunan University, 410082 Changsha |
| |
| Abstract: | In this paper, a new direct algorithm for solving linear complementarity problem with Z-matrix is proposed. The algorithm exhibits either a solution or its nonexistence after at most, steps (where n is the dimension of the problem) and the computational complexity is at most1/3n3 + O(n2) The research is supported by NNSF of China. |
| |
| Keywords: | Linear complementarity problem direct algorithm Z-matrix least solution computational complexity |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
