Applying parallel direct solver techniques to build robust high performance preconditioners

Authors:
Pascal Hénon;François Pellegrini;Pierre Ramet;Jean Roman;Yousef Saad
Affiliations:
ScAlApplix Project, INRIA Futurs and LaBRI UMR 5800, Université Bordeaux 1, Talence Cedex, France;ScAlApplix Project, INRIA Futurs and LaBRI UMR 5800, Université Bordeaux 1, Talence Cedex, France;ScAlApplix Project, INRIA Futurs and LaBRI UMR 5800, Université Bordeaux 1, Talence Cedex, France;ScAlApplix Project, INRIA Futurs and LaBRI UMR 5800, Université Bordeaux 1, Talence Cedex, France;Dept of computer Science & Eng, University of Minnesota, Minneapolis, MN
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 6
Cited 0

A framework for block ILU factorizations using block-size reduction

Mathematics of Computation
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of our 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 preconditioners based on a parallel incomplete factorization. The idea is then to define an adaptive blockwise incomplete factorization that is much more accurate (and numerically more robust) than the scalar incomplete factorizations commonly used to precondition iterative solvers.