A domain decomposition method applied to the simplified transport equations

被引：1

作者：

Barrault, Maxime ^{[1
]}

Lathuilere, Bruno ^{[2
]}

Ramet, Pierre ^{[3
]}

Roman, Jean ^{[3
]}

机构：

[1] EDF R&D Clamart, Clamart, France

[2] INRIA, EDF R&D Clamart, Bordeaux, France

[3] INRIA, LaBRI UMR5800, Bordeaux, France

来源：

CSE 2008:11TH IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING, PROCEEDINGS | 2008年

关键词：

domain decomposition; neutron transport; Lagrange multiplers; Krylov based Uzawa algorithm;

D O I：

10.1109/CSE.2008.50

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：91 / +

页数：2