计算物理 ›› 2008, Vol. 25 ›› Issue (6): 673-682.

• 研究论文 • 上一篇    下一篇

块三对角线性方程组不完全分解预条件的一种一维区域分解并行化方法

吴建平1, 宋君强2, 李晓梅2   

  1. 1. 国防科技大学计算机学院, 湖南 长沙 410073;
    2. 装备指挥技术学院, 北京 101416
  • 收稿日期:2007-06-25 修回日期:2007-11-26 出版日期:2008-11-25 发布日期:2008-11-25
  • 作者简介:吴建平(1974-),男,博士,副研究员,主要从事科学计算与并行算法方面的研究.
  • 基金资助:
    计算物理重点实验室基金;并行与分布处理重点实验室基金;国家自然科学基金(10505030,40505023)资助项目

Parallelization of Incomplete Factorization Preconditioning of Block Tridiagonal Linear Systems with 1-D Domain Decomposition

WU Jianping1, SONG Junqiang2, LI Xiaomei2   

  1. 1. School of Computer Science, National University of Defense Technology, Changsha 410073, China;
    2. Institute of Command and Technology of Equipment, Beijing 101416, China
  • Received:2007-06-25 Revised:2007-11-26 Online:2008-11-25 Published:2008-11-25

摘要: 对块三对角线性方程组,不完全分解是最有效的预条件之一,但它本质上是一个串行计算过程,难以有效并行化.基于一维重叠区域分解,对局部不完全分解得到的上、下三角因子分别各自进行组合,构造一类全局的并行不完全分解型预条件.在具体实现时,给出两种具体途径,其中一种基于所有重叠部分对应分量的交换.之后,在仔细对其中的计算过程进行分析的基础上,给出一种只需要一条网格线上分量通信的实现算法,大大减少了通信量,且通信不随重叠度的增加而增加.这种并行化方法可以应用于块三对角线性方程组的任何不完全分解型预条件.实验结果表明,文中提出的并行化方法普遍优于加性Schwarz并行化方法.

关键词: 线性方程组求解, 块三对角矩阵, 不完全分解, 加性Schwarz, 并行算法

Abstract: Based on one-dimensional domain decomposition with small overlapping, we approximate local lower and upper triangular incomplete factors and combine these factors into an effective approximation for global incomplete factorization preconditioner of coefficient matrix. Two implementations are considered. One is based on exchange of total boundary values of overlapped domain. The other is based on carefully arranged computation process to reduce communication of whole overlapped domain in one line of grid points. The parallelization method can be used to any incomplete factorization preconditioner. Experiments show that it is more efficient than widely-used additive Schwarz technique.

Key words: solution of linear systems, block tridiagonal matrix, incomplete factorization, additive Schwarz, parallel algorithm

中图分类号: