| 求解三对角线性方程组的迭代对角占优算法 |
| |
| 引用本文： | 李太全,肖柏勋.求解三对角线性方程组的迭代对角占优算法[J].计算机应用,2012,32(10):2742-2744. |
| |
| 作者姓名： | 李太全 肖柏勋 |
| |
| 作者单位： | 1. 长江大学 物理科学与技术学院,湖北 荆州4340022. 长江大学 地球物理与石油资源学院,湖北 荆州 434002 |
| |
| 基金项目： | 国家自然科学基金资助项目(41140034);湖北省教育厅重点资助项目(20081202) |
| |
| 摘 要： | 针对并行求解三对角线性方程组的对角占优(PDD)算法,在系数矩阵为弱对角占优时,近似处理引入误差较大的问题,提出了一种PDD算法的迭代方案。该方案在解的修正值计算中采用迭代方法,计算精度得到了提高；通过对算法的误差分析,导出了算法在给定误差下迭代次数的估算式；数值实验说明了算法的有效性。通过对迭代与非迭代的PDD算法的复杂性分析,迭代算法的计算复杂性增加很小,但通信复杂性随迭代次数成倍增加。
|
| 关 键 词： | 对角占优算法 迭代 三对角线性方程组 分布式存储 并行计算 |
| 收稿时间： | 2012-04-18 |
| 修稿时间： | 2012-05-28 |
Iterated parallel diagonal dominant algorithm for tridiagonal systems |
| |
| LI Tai-quan,XIAO Bo-xun.Iterated parallel diagonal dominant algorithm for tridiagonal systems[J].journal of Computer Applications,2012,32(10):2742-2744. |
| |
| Authors: | LI Tai-quan XIAO Bo-xun |
| |
| Affiliation: | 1. School of Physical Science and Technology, Yangtze University, Jingzhou Hubei 434002, China2. School of Geophysice and Oil Resource, Yangtze University, Jingzhou Hubei 434002, China |
| |
| Abstract: | In parallel solving weak diagonal dominant tridiagonal systems,the approximate error of the Parallel Diagonal Dominant(PDD) algorithm cannot be ignored.An iterated PDD algorithm was presented.In the algorithm,the solution of the correction value was calculated by iterative method,and the computational accuracy was obviously improved.Through error analysis on the algorithm,an estimation formula of iteration number was derived for a given error tolerance.And the numerical experiment shows the validity.Based on the complexity analysis of the iterative and non-iterative PDD algorithm,the increase of iterative algorithm computational complexity is very small,but the communication complexity increases exponentially with the iteration number. |
| |
| Keywords: | Parallel Diagonal Dominant(PDD) algorithm iteration tridiagonal systems distributed memory parallel computing |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
