A subzone reconstruction algorithm for efficient staggered compatible remapping

Journal Article · Tue Sep 01 04:00:00 EDT 2015 · Journal of Computational Physics

DOI:https://doi.org/10.1016/J.JCP.2015.04.046· OSTI ID:22465649

Staggered-grid Lagrangian hydrodynamics algorithms frequently make use of subzonal discretization of state variables for the purposes of improved numerical accuracy, generality to unstructured meshes, and exact conservation of mass, momentum, and energy. For Arbitrary Lagrangian–Eulerian (ALE) methods using a geometric overlay, it is difficult to remap subzonal variables in an accurate and efficient manner due to the number of subzone–subzone intersections that must be computed. This becomes prohibitive in the case of 3D, unstructured, polyhedral meshes. A new procedure is outlined in this paper to avoid direct subzonal remapping. The new algorithm reconstructs the spatial profile of a subzonal variable using remapped zonal and nodal representations of the data. The reconstruction procedure is cast as an under-constrained optimization problem. Enforcing conservation at each zone and node on the remapped mesh provides the set of equality constraints; the objective function corresponds to a quadratic variation per subzone between the values to be reconstructed and a set of target reference values. Numerical results for various pure-remapping and hydrodynamics tests are provided. Ideas for extending the algorithm to staggered-grid radiation-hydrodynamics are discussed as well as ideas for generalizing the algorithm to include inequality constraints.

• OSTI ID: 22465649
• Journal Information: Journal of Computational Physics, Journal Name: Journal of Computational Physics Vol. 296; ISSN 0021-9991; ISSN JCTPAH
• Country of Publication: United States
• Language: English

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
97 MATHEMATICS AND COMPUTING
ACCURACY
ALGORITHMS
GEOMETRY
HYDRODYNAMICS
LAGRANGIAN FUNCTION
LIMITING VALUES
OPTIMIZATION