计算物理 ›› 1999, Vol. 16 ›› Issue (6): 630-637.

• 论文 • 上一篇    下一篇

周期三对角线性方程组的分布式并行算法

迟利华, 刘杰, 李晓梅   

  1. 国防科学技术大学计算机学院, 长沙 410073
  • 收稿日期:1998-08-11 出版日期:1999-11-25 发布日期:1999-11-25
  • 作者简介:迟利华,博士生
  • 基金资助:
    "九五"国防预研基金和应用物理与计算数学研究所计算物理实验室预研基金资助

A parallel algorithm for periodic tridiagonal linear systems for distributed memory systems

Chi Lihua, Liu Jie, Li Xiaomei   

  1. Computer College, National University of Defense Technology, Changsha 410073
  • Received:1998-08-11 Online:1999-11-25 Published:1999-11-25

摘要: 提出一种求解严格对角占优周期三对角线性方程组的并行算法(简称PAA 算法),新算法计算复杂性为O(8n),通讯复杂性为O(1).目前求解此类方程组的最优并行算法的计算复杂性为O(17n),通讯复杂性为O(logP).在SGI Indy 工作站网络环境下的试算结果表明,加速比呈线性增加,并行效率达到90%.

关键词: 三对角线性方程组, 并行算法, 工作站机群

Abstract: A parallel algorithm (PAA algorithm) is presented for the solution of diagonally dominant periodic tridiagonal linear systems. Its computation complexity is O(8n) and its communication complexity is O(1). But now the computation and communication complexity of the best parallel algorithm are O(17n) and O (log P) respectively. The PAA algorithm is implemented on the SGI Indy workstation cluster. The results show that the speed up has been improved linearly and the paralleling efficiency reaches to 90%.

Key words: periodic tridiagonal linear system, parallel algorithm, workstation cluster

中图分类号: