期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

新的预条件AOR迭代法和新的比较定理 被引量：3

New preconditioned AOR iterative method and comparison theorems
下载PDF
导出
摘要 提出了一种新的预处理矩阵,并研究了新的预处理AOR迭代法的收敛性,建立了新的预处理AOR法与(I+S)下AOR迭代法以及和经典AOR迭代法之间的比较定理.数值例子验证了定理的正确性并说明了这种方法的有效性. A new preconditioned matrix was proposed, the convergence of the new preconditioned AOR iterative method was discussed and some new comparison theorems between two different preconditioned AOR methods and between the new preconditioned AOR method and the classical AOR iterative method were established. Finally, numerical experiments were used to demonstrate the feasibility and effectiveness of the new preconditioned AOR iterative method.
作者 常岩磊 张国凤 赵景余
机构地区 兰州大学数学与统计学院
出处 《兰州大学学报（自然科学版）》 CAS CSCD 北大核心 2009年第1期112-114,共3页 Journal of Lanzhou University(Natural Sciences)
基金 教育部"春晖计划"项目(Z2005-2-62002) 回国留学人员基金项目(教外司留[2005]546)
关键词 M-矩阵 预条件 AOR迭代方法 SOR迭代方法 收敛性 M-matrix preconditioning AOR method SOR method convergence
分类号 O241.81 [理学—计算数学]
  • 相关文献

参考文献8

  • 1BAI Zhong-zhi. A class of modified block SOR preconditioners for symmetric positive definite systems of linear equations[J]. Advances in Computational Mathematics, 1999, 186(6): 169-186.
  • 2BAI Zhong-zhi. Modified block SSOR preconditioners for symmetric positive definite linear systems[J]. Annals of Operations Research, 2001, 103(7): 263- 282.
  • 3BAI Zhong-zhi, NG M K. Preconditioners for nonsymmetric block Toeplitz-like-plus diagonal linear systems[J]. Numerische Mathematik, 2003,96(2): 197-220.
  • 4BERMAN A, PLEMMOMS R J. Nonnegative matrices in the mathematical sciences[M]. Philadelphia: Society for Industrial and Applied Mathematics, 1994: 42-47.
  • 5GUNAWARDENA A D, JAIN S K, SNYDER L. Modified iterative methods for consistent linear system[J]. Linear Algebra and Its Applications, 1991, 154(1): 123-143.
  • 6VARGA R S. Matrix iterative analysis[M]. Berlin: Springer Verlag, 2000.
  • 7HISASHI K. A comparison theorem for the iteratire method with the preconditioner (I + Smax)[J]. J Comput Appl Math, 2002, 145(2): 373-378.
  • 8张国凤,孙红蕊.一些具有较少迭代次数和较好稳定性的新型 PDIRK方法(英文)[J].兰州大学学报（自然科学版）,2003,39(5):1-5. 被引量：2

二级参考文献6

  • 1van der Houwen P J,Sommeijer B P. Iterated Runge Kutta methods on parallel computers[J]. SIAM J Sci Statist Comput, 1991,12 : 1000-1028.
  • 2van der Houwen P J,Sommeijer B P,Couzy W. Embedded diagonally implicit Runge Kutta algorithms on parallel computers[J]. Math Comp, 1992,58:135-159.
  • 3Sommeijer B P. Parallel-iterated Runge Kutta methods for stiff ordinary differential equations[J]. J Comput Appl Math, 1993,45 : 151-168.
  • 4Nguyen huu Cong. A parallel DIRK method for stiff initial-value problem [J]. J Comput Appl Math, 1994, 54:121-127.
  • 5Franco J M, Gomez I. Two three-parallel and three-processor SDIRK methods for stiff initial-value problems[J].J Comput Appl Math,1997,87,119-134.
  • 6Franeo J M, Gomez I. A parallel diagonally iterated RK method for convection-diffusion and stiff problems[J].Commun Numer Meth Engng,1998,14:821-837.

共引文献1

同被引文献22

  • 1李爱娟,畅大为.预条件SOR迭代方法及收敛性的比较[J].曲阜师范大学学报（自然科学版）,2005,31(4):48-50. 被引量：5
  • 2王卫芳,柳卫东,畅大为.预条件AOR迭代法比较性定理[J].洛阳师范学院学报,2007,26(2):11-14. 被引量：1
  • 3方保镕 周继东 李医民.矩阵论[M].北京:清华大学出版社,2004..
  • 4胡家赣.线性方程组的迭代解法[M].北京:科学出版社,1997.
  • 5Kohno T, Kotakemori H. Improving the modified gauss-seidel method for z-matrices [ J]. Linear Algebra Appl, 1997, 267(11) : 113-123.
  • 6Hadjidimos A. Accelerated over-relaxtion mehod[J]. Math. Comput, 1978, 32(141 ) : 149-157.
  • 7Varga R S. Matrix iterative analysis, prentice-Hall[ M ]. Englewood cliffs, NJ. 1962.
  • 8Yip E L. A necessary and sufficient condition for m-matrices and its relation to block LU factorizationE J. Linear Algebra and its Applications, 1995, 235( 1 ) : 261-274.
  • 9石艳超,徐安农.预条件Gauss-Seidel迭法[J].2008.3(28):258-260.
  • 10Kotakemori H,,Harada K,M Morimoto,et al.A comparison theorem for the iterative method withthe preconditioner(I+Smax). J Compute Appl Math . 2002

引证文献3

兰州大学学报（自然科学版）
2009年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部