Partitioning and Blocking Issues for a Parallel Incomplete Factorization

Pascal Hénon (1) , Pierre Ramet (1, 2) , Jean Roman (1, 2)

1 SCALAPPLIX - Algorithms and high performance computing for grand challenge applications
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

The purpose of this work is to provide a method which exploits the parallel block-wise 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.

Mots clés: Sparse

Pascal Hénon, Pierre Ramet, Jean Roman. Partitioning and Blocking Issues for a Parallel Incomplete Factorization. PARA'06, 2006, Umea, Sweden. pp.929--937. ⟨inria-00346624⟩