计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (3): 60-63.DOI: 10.3778/j.issn.1002-8331.2009.03.017

• 研究、探讨 • 上一篇    下一篇

块三对角线性方程组的并行直接解法

樊艳红,吕全义,聂玉峰   

  1. 西北工业大学 应用数学系,西安 710072
  • 收稿日期:2008-01-07 修回日期:2008-03-28 出版日期:2009-01-21 发布日期:2009-01-21
  • 通讯作者: 樊艳红

Improved parallel algorithm for solving block-tridiagonal linear equations

FAN Yan-hong,LV Quan-yi,NIE Yu-feng   

  1. Department of Applied Mathematics,Northwestern Polytechnical University,Xi’an 710072,China
  • Received:2008-01-07 Revised:2008-03-28 Online:2009-01-21 Published:2009-01-21
  • Contact: FAN Yan-hong

摘要: 提出了分布式环境下求解块三对角线性方程组的一种并行算法,该算法充分利用系数矩阵结构的特殊性,通过对系数矩阵进行适当分解及近似处理,使算法只在相邻处理机间通信两次。并从理论上给出了算法有效的一个充分条件。最后,在HP rx2600集群上进行了数值实验,结果表明,实算与理论是一致的,并行性也很好。

关键词: 块三对角线性方程组, 矩阵分解, 并行算法, 并行效率, HP rx2600集群

Abstract: A parallel algorithm for block-tridiagonal linear equations on distributed-memory multi-computers is presented.Making full use of the special structure of the coefficient matrix,the algorithm is based on decomposing the coefficient matrix properly and approximately disposing the matrix.The communication only needs twice between the adjacent processors.In theory,this paper gives a sufficient condition about effectivity of this algorithm.Finally,some numerical results on HP rx2600 cluster show that practice computing is consistent with theory.The algorithm’s parallelism is preferable.

Key words: block-tridiagonal linear equations, decomposition of the matrix, parallel algorithm, parallel efficiency, HP rx2600 cluster