A Parallel Multistage ILU Factorization Based on a Hierarchical Graph Decomposition

Authors:
Pascal He´non;Yousef Saad
Affiliations:
-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2006

Citing 0
Cited 5

PT-Scotch: A tool for efficient parallel graph ordering

Parallel Computing
Parallel finite element simulations of incompressible viscous fluid flow by domain decomposition with Lagrange multipliers

Journal of Computational Physics
Modification and Compensation Strategies for Threshold-based Incomplete Factorizations

SIAM Journal on Scientific Computing
A Robust Two-Level Incomplete Factorization for (Navier-)Stokes Saddle Point Matrices

SIAM Journal on Matrix Analysis and Applications
Parallel multistage preconditioners based on a hierarchical graph decomposition for SMP cluster architectures with a hybrid parallel programming model

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.