Search NASA⌕ Search

Engineering topics

Anderson, Robert W.

Publications and source records attributed to Anderson, Robert W..

High-Order Multi-Material ALE Hydrodynamics

Here, we present a new approach for multi-material arbitrary Lagrangian--Eulerian (ALE) hydrodynamics simulations based on high-order finite elements posed on high-order curvilinear meshes. The method builds on and extends our previous work in the Lagrangian and remap phases of ALE, and depends critically on a functional perspective that enables subzonal physics and material modeling. Curvilinear mesh relaxation is based on node movement, which is determined through the solution of an elliptic equation. The remap phase is posed in terms of advecting state variables between two meshes over a fictitious time interval. The resulting advection equation is solved by a discontinuous Galerkin (DG) formulation, combined with a customized Flux Corrected Transport (FCT) type algorithm. Because conservative fields are remapped, additional synchronization steps are introduced to preserve bounds with respect to primal fields. These steps include modification of the low-order FCT solutions, definition of conservative FCT fluxes based on primal field bounds, and monotone transitions between primal and conservative fields.

97 MATHEMATICS AND COMPUTING↗

Advances in Patch-Based Adaptive Mesh Refinement Scalability

Patch-based structured adaptive mesh refinement (SAMR) is widely used for high-resolution simu- lations. Combined with modern supercomputers, it could provide simulations of unprecedented size and resolution. A persistent challenge for this com- bination has been managing dynamically adaptive meshes on more and more MPI tasks. The dis- tributed mesh management scheme in SAMRAI has made some progress SAMR scalability, but early al- gorithms still had trouble scaling past the regime of 105 MPI tasks. This work provides two critical SAMR regridding algorithms, which are integrated into that scheme to ensure efficiency of the whole. The clustering algorithm is an extension of the tile- clustering approach, making it more flexible and efficient in both clustering and parallelism. The partitioner is a new algorithm designed to prevent the network congestion experienced by its prede- cessor. We evaluated performance using weak- and strong-scaling benchmarks designed to be difficult for dynamic adaptivity. Results show good scaling on up to 1.5M cores and 2M MPI tasks. Detailed timing diagnostics suggest scaling would continue well past that.

97 MATHEMATICS AND COMPUTING↗