Skip to Main content Skip to Navigation
Journal articles

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
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00346018
Contributor : Pierre Ramet Connect in order to contact the contributor
Submitted on : Wednesday, December 10, 2008 - 6:22:09 PM
Last modification on : Saturday, June 25, 2022 - 10:31:04 AM

Identifiers

  • HAL Id : inria-00346018, version 1

Collections

Citation

Pascal Hénon, Pierre Ramet, Jean Roman. On finding approximate supernodes for an efficient ILU(k) factorization. Parallel Computing, Elsevier, 2008, 34, pp.345--362. ⟨inria-00346018⟩

Share

Metrics

Record views

92