快速检索:      
引用本文:
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 292次   下载 364 本文二维码信息
码上扫一扫!
分享到: 微信 更多
关于解线性系统的新迭代方法的注释
王珂1, 谭丽君1, 王世恒2
1.上海大学 理学院, 上海 200444;2.南阳农业职业学院 基础部, 南阳 473000
摘要:
在文[3]中作者们提出了几种求解线性系统的新迭代方法,与经典的Jacobi或Gauss-Seidel方法相比,这些方法可以被应用到更多的线性系统且有更快的收敛速度.通过分析和数值算例说明他们的方法适合更一般的矩阵,而不仅仅是文[3]作者提到的只适合正矩阵.
关键词:  迭代法  线性系统  经典迭代
DOI:10.3969/J.ISSN.100-5137.2017.03.008
分类号:
基金项目:This research was supported by National Natural Science Foundation of China (11301330);grants of "The First-class Discipline of Universities in Shanghai" and Gaoyuan Discipline of Shanghai
Comments on new iterative methods for solving linear systems
Wang Ke1, Tan Lijun1, Wang Shiheng2
1.College of Sciences, Shanghai University, Shanghai 200444, China;2.Department of Basic Education, Nanyang Vocational College of Agriculture, Nanyang 473000, China
Abstract:
Some new iterative methods were presented by Du, Zheng and Wang for solving linear systems in [3], where it is shown that the new methods, comparing to the classical Jacobi or Gauss-Seidel method, can be applied to more systems and have faster convergence. This note shows that their methods are suitable for more matrices than positive matrices which the authors suggested through further analysis and numerical examples.
Key words:  iterative method  linear system  classical iteration