Two-step hybrid conservative remapping for multimaterial arbitrary Lagrangian-Eulerian methods

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F11%3A00181271" target="_blank" >RIV/68407700:21340/11:00181271 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.jcp.2011.05.003" target="_blank" >http://dx.doi.org/10.1016/j.jcp.2011.05.003</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.jcp.2011.05.003" target="_blank" >10.1016/j.jcp.2011.05.003</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Two-step hybrid conservative remapping for multimaterial arbitrary Lagrangian-Eulerian methods

Popis výsledku v původním jazyce

We present a new hybrid conservative remapping algorithm for multimaterial Arbitrary Lagrangian-Eulerian (ALE) methods. The hybrid remapping is performed in two steps. In the first step, only nodes of the grid that lie inside subdomains occupied by single materials are moved. At this stage, computationally cheap swept-region remapping is used. In the second step, nodes that are vertices of mixed cells (cells containing several materials) and vertices of some cells in a buffer zone around mixed cells aremoved. At this stage, intersection-based remapping is used. The hybrid algorithm results in computational expense that lies between swept-region and intersection-based remapping We demonstrate the performance of our new method for both structured and unstructured polygonal grids in two dimensions, as well as for cell-centered and staggered discretizations.

Název v anglickém jazyce

Two-step hybrid conservative remapping for multimaterial arbitrary Lagrangian-Eulerian methods

Popis výsledku anglicky

We present a new hybrid conservative remapping algorithm for multimaterial Arbitrary Lagrangian-Eulerian (ALE) methods. The hybrid remapping is performed in two steps. In the first step, only nodes of the grid that lie inside subdomains occupied by single materials are moved. At this stage, computationally cheap swept-region remapping is used. In the second step, nodes that are vertices of mixed cells (cells containing several materials) and vertices of some cells in a buffer zone around mixed cells aremoved. At this stage, intersection-based remapping is used. The hybrid algorithm results in computational expense that lies between swept-region and intersection-based remapping We demonstrate the performance of our new method for both structured and unstructured polygonal grids in two dimensions, as well as for cell-centered and staggered discretizations.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Computational Physics

ISSN

0021-9991

e-ISSN

—

Svazek periodika

230

Číslo periodika v rámci svazku

17

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

24

Strana od-do

6664-6687

Kód UT WoS článku

000293034800015

EID výsledku v databázi Scopus

—