A swept‐intersection‐based remapping method in a ReALE framework

Abstract

SUMMARY A complete reconnection‐based arbitrary Lagrangian–Eulerian (ReALE) strategy devoted to the computation of hydrodynamic applications for compressible fluid flows is presented here. In ReALE, we replace the rezoning phase of classical ALE method by a rezoning where we allow the connectivity between cells of the mesh to change. This leads to a polygonal mesh that recovers the Lagrangian features in order to follow more efficiently the flow. Those reconnections allow to deal with complex geometries and high vorticity problems contrary to ALE method. For optimizing the remapping phase, we have modified the idea of swept‐integration‐based. The new method is called swept‐intersection‐based remapping method. We demonstrate that our method can be applied to several numerical examples representative of hydrodynamic experiments.Copyright © 2012 John Wiley & Sons, Ltd.

A swept intersection‐based remapping method for axisymmetric ReALE computation

“…The remapping step is the last step of the ReALE method. We present here the extension of the swept intersection‐based remapping method to cylindrical geometries. This method is different from the method applied in .…”

Grid noise in moving mesh codes: fixing the volume inconsistency problem

“…Based on Harribey et al (2013) we propose an alternative scheme that approximates the above. We modify steps (iii) and (iv) as follows:…”

A subzone reconstruction algorithm for efficient staggered compatible remapping

“…Unfortunately, the flux based algorithm of [21] implicitly assumes the topology of the mesh is not changing, only the geometry. Extensions to the flux-based remap have been presented that do not assumed a fixed topology, for instance [7,10], but the problem of remapping staggered or subzonal data has not yet been addressed. For this paper, we focus on geometric overlay-based remapping.…”