| 引用本文： |
-
段班祥,李郴良,徐安农.解线性互补问题的多重分裂乘性Schwarz算法[J].广西科学,2005,12(1):18-21. [点击复制]
- Duan Banxiang,Li Chenliang,Xu Annong.A Multi-Splitting and Multiplicative Schwarz Algorithm for Solving Linear Complementarity Problems[J].Guangxi Sciences,2005,12(1):18-21. [点击复制]
|
|
| 摘要: |
| 运用矩阵多重分裂理论并考虑并行计算,建立求解线性互补问题的多重分裂乘性Schwarz迭代算法,给出算法的收敛性定理,应用加权最大模获得了算法的收敛速度.数值结果表明,多重分裂乘性Schwarz迭代算法具有很好的有效性. |
| 关键词: Schwarz算法 线性互补问题 多重分裂 加权最大模 |
| DOI： |
| 投稿时间：2004-09-23修订日期：2005-01-04 |
| 基金项目: |
|
| A Multi-Splitting and Multiplicative Schwarz Algorithm for Solving Linear Complementarity Problems |
|
Duan Banxiang1, Li Chenliang2, Xu Annong2
|
| (1.Dept. of Software Engi., Guangdong Provincal College for Technical Personnel, Zhuhai, Guangdong, 519090, China;2.Dept. of Comp. Sci. & Math., Guilin Univ. of Elec. Tech., Guilin, Guangxi, 541004, China) |
| Abstract: |
| A multi-splitting and multiplicative Schwarz algorithm for solving linear complementarity problems was given.In particular,we establish the convergence theory of the algorithm and estimate weighted max-norm bounds for iteration errors.The simulation examples show that this algorithm is efficient. |
| Key words: Schwarz algorithm linear complementarity problem multi-splitting weighted max-norm |
