首页 | 官方网站   微博 | 高级检索  
     

求解块三对角方程组的一种并行策略
引用本文:段治健,杨永,吕全义,马欣荣.求解块三对角方程组的一种并行策略[J].计算机工程与应用,2011,47(13):46-49.
作者姓名:段治健  杨永  吕全义  马欣荣
作者单位:1. 西北工业大学,翼型叶栅空气动力学国防科技重点实验室,西安,710072
2. 西北工业大学,应用数学系,西安,710072
3. 咸阳师范学院,数学系,陕西,咸阳,712000
基金项目:陕西省教育厅科研项目,咸阳师范学院重点课程项目
摘    要:提出了一种在MIMD分布式存储环境下求解块三对角线性方程组的并行算法。基于Galerkin原理适当取基构造算法,使整个计算过程只在相邻处理机间通信两次,并给出了系数矩阵为对称正定矩阵时算法收敛的条件。在HP rx2600集群系统上进行的数值计算结果表明该算法与多分裂方法相比具有较高的加速比和并行效率。

关 键 词:块三对角线性方程组  Galerkin原理  HP  rx2600集群  并行性
修稿时间: 

Parallel strategy for solving block-tridiagonal linear systems
DUAN Zhijian,YANG Yong,LV Quanyi,MA Xinrong.Parallel strategy for solving block-tridiagonal linear systems[J].Computer Engineering and Applications,2011,47(13):46-49.
Authors:DUAN Zhijian  YANG Yong  LV Quanyi  MA Xinrong
Affiliation:1.National Key Lab of Aerodynamic Design and Research,Northwestern Polytechnical University,Xi’an 710072,China 2.Department of Applied Mathematics,Northwestern Polytechnical University,Xi’an 710072,China 3.Department of Mathematics,Xianyang Normal University,Xianyang,Shaanxi 712000,China
Abstract:This paper focuses on a parallel iterative method for solving block-tridiagonal linear systems on distributed-memory multi-computers.Through choosing the base of subspace based on Galerkin theory,the communication only need twice between the adjacent processors per iteration step.Furthermore,the sufficient condition for convergence is given when the coefficient matrix A is a symmetric positive definite matrix.Finally,the numerical experiments implemented on HP rx2600 cluster indicate that the algorithm’s parallel acceleration rates and efficiency are higher than the multi-splitting method’s.
Keywords:block-tridiagonal linear systems  Galerkin theory  HP rx2600 cluster  parallelism
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号