首页 | 本学科首页   官方微博 | 高级检索  
     

求解线性互补问题的松弛型二级多分裂算法
引用本文:董晓亮,唐清干,李彬良,杨晓辉. 求解线性互补问题的松弛型二级多分裂算法[J]. 桂林电子科技大学学报, 2006, 26(6): 496-498
作者姓名:董晓亮  唐清干  李彬良  杨晓辉
作者单位:桂林电子科技大学,数学与计算科学学院,广西,桂林,541004;桂林电子科技大学,数学与计算科学学院,广西,桂林,541004;桂林电子科技大学,数学与计算科学学院,广西,桂林,541004;桂林电子科技大学,数学与计算科学学院,广西,桂林,541004
摘    要:运用二级迭代方法与矩阵多分裂理论,同时考虑并行计算和松弛迭代,提出了求解线性互补问题的二级多分裂AOR并行算法,在一定条件下证明了算法的收敛性.该算法具有计算量小等优点.

关 键 词:线性互补问题  二级多分裂  并行计算
文章编号:1673-808X(2006)06-0496-03
收稿时间:2006-06-24
修稿时间:2006-06-24

Two-stage multi-splitting parallel AOR algorithm for linear complementarity problems
DONG Xiao-liang,TANG Qing-gan,LI Chen-liang,YANG Xiao-hui. Two-stage multi-splitting parallel AOR algorithm for linear complementarity problems[J]. Journal of Guilin University of Electronic Technology, 2006, 26(6): 496-498
Authors:DONG Xiao-liang  TANG Qing-gan  LI Chen-liang  YANG Xiao-hui
Affiliation:School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin 541004,China
Abstract:A two-stage multi-splitting AOR parallel algorithm for linear complementarity problems is proposed in this paper. Theories of two-stage method and multi-splltting method have been applied. Numerical results suggest that the method is efficienct and promising. Therefore, the proposed method is suitable for parallel computation of large-scale problem.
Keywords:linear complementarity problem   two-stage multi-splitting   parallel computation
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号