求解线性互补问题的松弛型二级多分裂算法  

Two-stage multi-splitting parallel AOR algorithm for linear complementarity problems

作　　者：董晓亮[1] 唐清干[1] 李彬良[1] 杨晓辉[1] 

机构地区：[1]桂林电子科技大学数学与计算科学学院,广西桂林541004

出　　处：《桂林电子科技大学学报》2006年第6期496-498,共3页Journal of Guilin University of Electronic Technology

摘　　要：运用二级迭代方法与矩阵多分裂理论,同时考虑并行计算和松弛迭代,提出了求解线性互补问题的二级多分裂AOR并行算法,在一定条件下证明了算法的收敛性。该算法具有计算量小等优点。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.

关 键 词：线性互补问题 二级多分裂 并行计算 

分 类 号：O221.2[理学—运筹学与控制论]