An Efficient Linearity and Bound Preserving Remapping) for Meshes with Changing Connectivity

Milan Kucharik kucharik@cut.this.part.karkulka.fjfi.cvut.cz

Mikhail Shashkov shashkov@cut.this.part.lanl.gov

Remapping is one of the essential parts of most Arbitrary Lagrangian-Eulerian (ALE) methods, which recomputes conservative quantities (as density, momenta, and energy) from the original Lagrangian computational grid, to the rezoned one. For the purpose of ALE methods, we require this algorithm to be conservative, linearity and local-bound preserving, and stable. We have developed such algorithm for grids with identical topology both in 2D and 3D.

In this report we present an extension of the remapping algorithm to the case of grids with different topology. We describe the strategy in situations when reconnection occurs. To show that all the required properties are accomplished, we present a numerical example using the widely used Voronoi meshes.