一类新预条件下AOR迭代法比较性定理  

A New Comparison Theorem for the Preconditioned AOR Iterative Method

作　　者：黄湧辉[1] 

机构地区：[1]华南师范大学数学科学学院,广东广州510631

出　　处：《汕头大学学报（自然科学版）》2011年第2期29-35,共7页Journal of Shantou University：Natural Science Edition

摘　　要：讨论了新预条件下AOR迭代法的收敛性.若系数矩阵为非奇异M-矩阵,该预条件加快了AOR迭代法的收敛速度,而且该预条件下AOR迭代法的谱半径是单调下降的.最后用数值例子说明了结论.In this paper,the convergence analysis for a new preconditioned AOR iterative method is discussed. If the coefficient matrix is a nonsingular M-matrix,the convergence rate of the preconditioned AOR iterative method is faster than one of the AOR methods. In addition,the spectral radius of the preconditioned AOR iterative method is monotone decreasing. At last,some numerical examples are given to explain our theoretical results.

关 键 词：谱半径 预条件迭代法 非奇异M-矩阵 收敛速度 弱正则分裂 

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