并行多分裂块松弛TOR迭代算法的收敛性  

Convergence of parallel multisplitting block relaxation TOR iterative algorthms

作　　者：向淑晃[1] 张生雷[1] 

机构地区：[1]中南大学数学科学与计算技术学院,湖南长沙410083

出　　处：《云南大学学报（自然科学版）》2004年第1期30-34,共5页Journal of Yunnan University(Natural Sciences Edition)

基　　金：湖南省自然科学基金资助项目(02JJY2006).

摘　　要：分析了求解大型线性方程组的并行多分裂块松弛TOR迭代算法,在更弱的条件下得到了该算法的收敛准则,同时也给出了相应块迭代矩阵谱半径的上界估计式.It is presented a class of parallel multisplitting block relaxation iteration algorithms for solving large scale sparse block systems of linear algebraic equations.Under some weaker conditions,the convergence criterions of these new algorithms are obtained and some estimations of upper bounds of the spectral radii of the corresponding block iteration matrices are also presented.

关 键 词：线性方程组 块松弛迭代算法 收敛性 多重分裂 谱半径 

分 类 号：O241.6[理学—计算数学]