A domain decomposition method applied to the simplified transport equations

Maxime Barrault 1 Bruno Lathuilière 1 Pierre Ramet 2, 3 Jean Roman 2, 3
2 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
Abstract : The simulation of the neutron transport inside a nuclear reactor leads to the computation of the lowest eigen pair of a simplified transport operator. Whereas the sequential solution at our disposal today is really efficient, we are not able to run some industrial cases due to the memory consumption and the computational time. This problem brings us to study parallel strategies. In order to re-use an important part of the solver and to bypass some limitations of conforming cartesian meshes, we propose a non overlapping domain decomposition based on the introduction of Lagrange multipliers. The method performs well on up to $100$ processors for an industrial test case.
keyword : DDM
Type de document :
Communication dans un congrès
IEEE 11th International Conference on Computational Science and Engineering, 2008, Sao Paulo, Brazil. pp.91--97, 2008
Liste complète des métadonnées

https://hal.inria.fr/inria-00346022
Contributeur : Pierre Ramet <>
Soumis le : mercredi 10 décembre 2008 - 18:36:01
Dernière modification le : mardi 6 mars 2018 - 15:55:53

Identifiants

  • HAL Id : inria-00346022, version 1

Collections

Citation

Maxime Barrault, Bruno Lathuilière, Pierre Ramet, Jean Roman. A domain decomposition method applied to the simplified transport equations. IEEE 11th International Conference on Computational Science and Engineering, 2008, Sao Paulo, Brazil. pp.91--97, 2008. 〈inria-00346022〉

Partager

Métriques

Consultations de la notice

85