计算物理 ›› 1994, Vol. 11 ›› Issue (3): 353-361.

• 论文 • 上一篇    下一篇

非对称线性代数方程组的并行算法

刘兴平   

  1. 北京应用物理与计算数学研究所, 计算物理实验室 100088
  • 收稿日期:1992-11-09 修回日期:1994-01-17 出版日期:1994-09-25 发布日期:1994-09-25
  • 基金资助:
    国家自然科学基金和中物院科学基金

PARALLEL ALGORITHMS FOR UNSYMMETRIC LINEAR SYSTEMS

Liu Xingping   

  1. Laboratory of Computational Physics, IAPCM, Beijing
  • Received:1992-11-09 Revised:1994-01-17 Online:1994-09-25 Published:1994-09-25

摘要: 对五、七和九对角矩阵在并行-向量处理机上建立了解非对称线性代数方程组的PGCR算法,并分析了它的收敛性。本文给出的算法与多处理机的PGCR算法具有相同的选代次数。利用向量机模拟并行向量计算机并做数值实验,数值结果显示此算法很有效。

关键词: PGCR方法, 非对称线性代数方程组, 向量多处理机, 修正不完全LU分解

Abstract: An algorithm is proposed of the preconditioned generalized conjugate residual method for solving unsymmetric linear systems on a vector multiprocessor, when A is a five, seven or nine-diagonal matrix. The convergence of this iterative method is analysed. In this algorithm the iterations number is vesified to be about the same as for the multiprocessor PGCR algorithms.The resulting preconditioned GCR method has been tested by simulating a parallel-vector computer.Numerical examples indicate that the new algorithm is very efficient, when the vector multiprocessor computation is applied.

Key words: PGCR method, unsymmetric linear system, vector multiprocessor, modified incomplete choleski decomposition

中图分类号: