# A domain decomposition method applied to the simplified transport equations

2 SCALAPPLIX - Algorithms and high performance computing for grand challenge applications
CNRS - Centre National de la Recherche Scientifique : UMR5800, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Inria Bordeaux - Sud-Ouest, Université Sciences et Technologies - Bordeaux 1, Université Bordeaux Segalen - Bordeaux 2
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 :
Document type :
Conference papers

https://hal.inria.fr/inria-00346022
Contributor : Pierre Ramet <>
Submitted on : Wednesday, December 10, 2008 - 6:36:01 PM
Last modification on : Thursday, February 11, 2021 - 2:38:02 PM

### Identifiers

• HAL Id : inria-00346022, version 1

### 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. ⟨inria-00346022⟩

Record views