计算物理 ›› 1998, Vol. 15 ›› Issue (1): 35-42.

• 论文 • 上一篇    下一篇

间断问题的并行多重网格预条件共轭梯度法求解

莫则尧1,2, 李晓梅1, 张宝琳2   

  1. 1. 国防科技大学计算机系, 长沙 410073;
    2. 北京应用物理与计算数学研究所计算物理实验室 100088
  • 收稿日期:1996-09-24 出版日期:1998-01-25 发布日期:1998-01-25
  • 作者简介:莫则尧,男,26,助研,博士,国防科技大学计算机系计算物理实验室
  • 基金资助:
    自然科学基金和863-306高科技计划资助

PARALLEL MULTIGRID PRECONDITIONED CONJUGETE GRADIENT METHODS FOR INTERFACE PROBLEMS

Mo Zeyao1,2, Li Xiaomei1, Zhang Baolin2   

  1. 1. Dept. of Computer, National University of Defense Technology, Changsha 410073;
    2. Laboratory of Computational Physics, IAPCM, Beijing 100088
  • Received:1996-09-24 Online:1998-01-25 Published:1998-01-25

摘要: 首先比较了四种串行多重网格预条件共轭梯度法求解四类典型间断问题时,数值收敛因子与间断类型、间断程度、网格步长的关系;然后,在算法中引入Schwarz并行,探讨了并行算法收敛因子与子区域个数的关系,以及Schwarz并行的获益。给出了详细的性能比较结果。

关键词: 间断问题, 多重网格预条件, 并行Schwarz松驰, 收敛因子, 并行效率

Abstract: Four different types of serial multigrid preconditioned conjugate gradient algorithms are applied to treat interface problems, and their numerical convergence rates are also compared with respect to interface types, interface degree and stepsize. Schwarz parallelism is used for algorithms, and discussion concerns the convergence rates with respect to the number of subdomains, and the benefits owing to Schwarz parallelism. Detailed performence results are also given.

Key words: interface problems, multigrid preconditioner, parallel Schwarz relaxations, convergence rate, parallel efficiency

中图分类号: