GAIDAMOUR, Jérémie; HÉNON, Pascal

Métadonnées

Licence d’utilisation du document

GAIDAMOUR, Jérémie
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

HÉNON, Pascal
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

Langue

Communication dans un congrès

Ce document a été publié dans

11th International Conference on Computational Science and Engineering, 11th International Conference on Computational Science and Engineering, IEEE 11th International Conference on Computational Science and Engineering, 2008-07, Sao Paulo. 2008p. page 98--105

Résumé en anglais

In this paper, we present HIPS (Hierarchical Iterative Parallel Solver) a parallel sparse linear solver that combines effectively direct and iterative methods through a Schur complement approach. The corner stone of our method is to use a special decomposition and ordering of the matrix that allows to construct a reduced system and a robust preconditioner at low memory cost. The parallelization scheme we describe is original for this type of solver and provide a natural way to find a good trade-off between memory and convergence. Eventually, we give some results obtained by our solver on large referenced test cases.< Réduire

Mots clés en anglais

parallel sparse linear solver

Schur complement

iterative method

incomplete factorization

domain decomposition

hierarchical interface decomposition.

hierarchical interface decomposition

URI

https://oskar-bordeaux.fr/handle/20.500.12278/198543

Project ANR

SOLveurs et SimulaTIons en Calculs Extrême - ANR-06-CIS6-0010

Origine

Importé de hal

Unités de recherche

Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800