Skip to Main content Skip to Navigation
New interface
Conference papers

On finding approximate supernodes for an efficient ILU(k) factorization

Pascal Hénon 1 Pierre Ramet 1, 2 Jean Roman 1, 2 
1 SCALAPPLIX - Algorithms and high performance computing for grand challenge applications
Université Bordeaux Segalen - Bordeaux 2, Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
keyword : Sparse
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00346617
Contributor : Pierre Ramet Connect in order to contact the contributor
Submitted on : Thursday, December 11, 2008 - 7:36:08 PM
Last modification on : Saturday, June 25, 2022 - 10:31:17 AM

Identifiers

  • HAL Id : inria-00346617, version 1

Collections

Citation

Pascal Hénon, Pierre Ramet, Jean Roman. On finding approximate supernodes for an efficient ILU(k) factorization. PMAA'06, 2006, Rennes, France. ⟨inria-00346617⟩

Share

Metrics

Record views

30