Efficient parallel resolution of the simplified transport equations in mixed-dual formulation (Q630443)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient parallel resolution of the simplified transport equations in mixed-dual formulation |
scientific article; zbMATH DE number 5867125
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient parallel resolution of the simplified transport equations in mixed-dual formulation |
scientific article; zbMATH DE number 5867125 |
Statements
Efficient parallel resolution of the simplified transport equations in mixed-dual formulation (English)
0 references
17 March 2011
0 references
In the present article, based on the simplified transport equations is obtained a high parallel efficiency while improving the parallelization scheme of the Lagrangian domain decomposition method applied to the sequential power algorithm made of four nested loops. First, the authors change the location of the loop over the subdomains to obtain the same number of power iterations as the sequential algorithm. Secondly, the authors benefit from the characteristics of the Raviart-Thomas finite element to optimize the implementation of the new parallel algorithm.
0 references
simplified transport equation
0 references
Raviart-Thomas finite element
0 references
HPC
0 references
parallelism
0 references
domain decomposition method
0 references
0 references