预条件SOR迭代法和AOR迭代法的比较  

Comparison Theorems between the Preconditioned SOR Iterative Method and the AOR Iterative Method

作　　者：薛秋芳[1] 戴芳[1] 陈娟娟[1] 

机构地区：[1]西安理工大学理学院

出　　处：《西安理工大学学报》2010年第3期357-360,共4页Journal of Xi'an University of Technology

基　　金：国家自然科学基金资助项目(60971127)

摘　　要：研究M-矩阵类的预条件SOR迭代法,将其与相应矩阵的AOR迭代法进行比较,得到它们收敛性的比较定理,并从理论上证明预条件SOR迭代法优于AOR迭代法。The M-matrix precondition is considered to be applied to the SOR iterative method. And the preconditoned SOR method are compared with the AOR iterative method. Comparison theorems for the convergence of the methods is obtained and in theory it is proved that the preconditoned SOR method is superior to the AOR iterative method.

关 键 词：预条件 SOR迭代法 AOR迭代法 谱半径 

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