A Parallel Multistage ILU Factorization Based on a Hierarchical Graph Decomposition
A Parallel Multistage ILU Factorization Based on a Hierarchical Graph Decomposition
复制标题
基于层次图分解的并行多级ILU分解
DOI：
--
复制
发表时间：
2006
影响因子：
3.1
通讯作者：
Y. Saad
中科院分区：
文献类型：
--
作者：
P. Hénon;Y. Saad
PHIDAL（并行分层界面分解算法）是利用系数矩阵邻接图的分层界面分解的一种并行不完全分解方法。分解的思想类似于在领域分解中使用的众所周知的wirebasket技术。然而，该方法是为一般的、不规则结构的、稀疏的线性系统设计的。本文介绍了几种获得高质量层次图分解的算法，并讨论了分解过程的并行实现。数值实验证明了该算法的可扩展性及其作为通用并行线性系统求解器的有效性。
PHIDAL (parallel hierarchical interface decomposition algorithm) is a parallel incomplete factorization method which exploits a hierarchical interface decomposition of the adjacency graph of the coefficient matrix. The idea of the decomposition is similar to that of the well-known wirebasket techniques used in domain decomposition. However, the method is devised for general, irregularly structured, sparse linear systems. This paper describes a few algorithms for obtaining good quality hierarchical graph decompositions and discusses the parallel implementation of the factorization procedure. Numerical experiments are reported to illustrate the scalability of the algorithm and its effectiveness as a general purpose parallel linear system solver.