L-矩阵的新预条件AOR迭代法收敛性分析  

Convergence Analysis of Iterative Method for L-matrix under Preconditioned AOR

作　　者：黄湧辉[1] 

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

出　　处：《绵阳师范学院学报》2011年第5期19-23,共5页Journal of Mianyang Teachers＇ College

摘　　要：该文讨论了L-矩阵在新预条件下其AOR迭代法的收敛性.在严格对角占优的L-矩阵条件下,该预条件加快了AOR迭代法的收敛速度,而且该预条件下AOR迭代法的谱半径是单调下降的.最后用数值例子验证本文得出的结论的正确性.This paper is to discuss the convergence analysis of a new preconditioned AOR iterative method for L - matrix. If the coefficient matrix is a strictly＇ dominant L - 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 reconditioned AOR iterative method is monotonically decreasing. In the end, some numerical examples to verify the correctness of our theoretical results are given.

关 键 词：谱半径 预条件迭代法 严格对角占优L-矩阵 收敛速度 弱正则分裂 

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