Applying parallel direct solver skills to build robust and highly performant preconditioners

Pascal Hénon (1) , Francois Pellegrini (1, 2) , Pierre Ramet (1, 2) , Jean Roman (1, 2) , Yousef Saad (3, 4)

1 SCALAPPLIX - Algorithms and high performance computing for grand challenge applications
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 UMN - University of Minnesota [Twin Cities]
4 Department of Computer Science and Engineering [Minneapolis]

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.

Mots clés: Sparse

Pascal Hénon, Francois Pellegrini, Pierre Ramet, Jean Roman, Yousef Saad. Applying parallel direct solver skills to build robust and highly performant preconditioners. PARA'04, 2004, Copenhagen, Denmark. pp.601--619. ⟨inria-00346623⟩