Search NASA⌕ Search

DOE OSTI · 1885745

Multi-material swept face remapping on polyhedral meshes

Abstract

Remapping is a conservative interpolation of a discretized intensive quantity between two meshes. In this article, we propose a novel multi-material flux remapping method that avoids the geometric computation of mesh-mesh intersections needed for an accurate intersection based remap. The flux remap is applicable to scalar quantities such as material density describing the multi-material flow between meshes with the same connectivity but small mesh displacements. Herein, the method is described for two- and three-dimensional polygonal/polyhedral meshes as it is implemented in Portage. Another open source library, Tangram, is used to calculate material interfaces in cells containing more than one material. Performance and accuracy of the flux remap are discussed with respect to Arbitrary Lagrangian-Eulerian simulations and compared to an accurate intersection based remap. In particular, cyclic remapping shows that the accuracy of the flux remap is limited to first order on material boundaries while maintaining second order accuracy in pure material regions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Velechovsky, Jan, Kikinzon, Evgeny, Ray, Navamita, Rakotoarivelo, Hoby Nirina, Herring, Angela M., Kenamond, Mack Andrew, Lipnikov, Konstantin, Shashkov, Mikhail Jurievich, Garimella, Rao Veerabhadra, Shevitz, Daniel Wolf. 2022-08-24. Multi-material swept face remapping on polyhedral meshes. https://doi.org/10.1016/j.jcp.2022.111553

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING↗

Structured illumination for surface-resolved grazing-incidence X-ray scattering

Grazing-incidence (GI) scattering techniques are widely used to characterize thin films, offering high surface sensitivity and insight into morphology and structure. However, these approaches typically provide statistical averaged information due to elongated footprint or limited spatial resolution due to beam size. Here we introduce a method that combines structured illumination with GI X-ray scattering and leverages our computational imaging approach to resolve local structural details. We demonstrate that our method captures local features of an organic semiconductor thin film without the need for sample rotation as in tomography. The method expands GI techniques from statistical averaging to high-resolution imaging, thereby providing the capability for detailed analysis of local material properties, such as domain shape, orientation and polymorphism, which are critical for advancing material design towards more efficient and tailored materials.

97 MATHEMATICS AND COMPUTING↗