Partitioning and blocking issues for a parallel incomplete factorization

Authors:
Pascal Hénon;Pierre Ramet;Jean Roman
Affiliations:
INRIA Futurs and LaBRI, UMR, Université Bordeaux 1, Talence Cedex, France;INRIA Futurs and LaBRI, UMR, Université Bordeaux 1, Talence Cedex, France;INRIA Futurs and LaBRI, UMR, Université Bordeaux 1, Talence Cedex, France
Venue:
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Year:
2006

Citing 9
Cited 0

On finding supernodes for sparse matrix computations

SIAM Journal on Matrix Analysis and Applications
A framework for block ILU factorizations using block-size reduction

Mathematics of Computation
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Parallel threshold-based ILU factorization

SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
PASTIX: a high-performance parallel direct solver for sparse symmetric positive definite systems

Parallel Computing - Parallel matrix algorithms and applications
Recent Progress in General Sparse Direct Solvers

ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Adapting a parallel sparse direct solver to architectures with clusters of SMPs

Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
Improvement of the efficiency of genetic algorithms for scalable parallel graph partitioning in a multi-level framework

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this work is to provide a method which exploits the parallel blockwise algorithmic approach used in the framework of high performance sparse direct solvers in order to develop robust and efficient preconditioners based on a parallel incomplete factorization.