| 解线性互补问题的多分裂多松弛因子迭代算法 |
| |
| 引用本文： | 段班祥,朱小平.解线性互补问题的多分裂多松弛因子迭代算法[J].东莞理工学院学报,2010,17(3):10-14. |
| |
| 作者姓名： | 段班祥 朱小平 |
| |
| 作者单位： | 广东科学技术职业学院,计算机工程技术学院,广东珠海,519090 |
| |
| 摘 要： | 考虑矩阵的多重分裂与处理器的并行计算,提出了求解线性互补问题的多分裂多松弛参数迭代算法,利用M-矩阵和H-矩阵的性质及松弛迭代的收敛性,证明了算法产生的迭代点列的聚点为原互补问题的解。最后,为提高算法的收敛速度,分析了ILU分解预处理技术的收敛特性。
|
| 关 键 词： | 线性互补问题 多分裂 松弛迭代 H-矩阵 ILU分解 收敛性 |
The Multi-splitting and Multi-parameters Iterative Method for Linear Complementarity Problem |
| |
| DUAN Ban-xiang,ZHU Xiao-ping.The Multi-splitting and Multi-parameters Iterative Method for Linear Complementarity Problem[J].Journal of Dongguan Institute of Technology,2010,17(3):10-14. |
| |
| Authors: | DUAN Ban-xiang ZHU Xiao-ping |
| |
| Institution: | DUAN Ban-xiang ZHU Xiao-ping (Computer Engineering Technical College,Guangdong Institute of Science , Technology,Zhuhai 519090,China) |
| |
| Abstract: | According to parallel computing between the matrix multi-splitting and processor,we proposed the solution to the linear complementarity problem of relaxed multi-splitting parameter iterative algorithm and proved that any accumulation point of the iterates generated by the algorithm solves the linear complementarity problem by using M-matrix and H-matrix properties and relaxation iteration.Finally,to improve the convergence speed we analyzed ILU decomposition of pretreatment technology convergence. |
| |
| Keywords: | linear complementarity problem multi-splitting relaxation method H- matrix ILU factorization Convergence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
