Efficient second order remapping on arbitrary two dimensional meshes
The authors have developed an efficient method of remapping physical variables from one unstructured grid composed of arbitrary polygons to another, based on the work of Ramshaw and Dukowicz. Eulerian cycles are used to convert the mesh into a single chain of connected edge,s which eliminates grid searching. The error is second order in the zone size. The algorithm handles degenerate meshes well. Computational effort to perform a remap scales linearly with the number of zones in the two grids, which is an improvement over typical N log N methods.
- Research Organization:
- Lawrence Livermore National Lab., CA (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 231698
- Report Number(s):
- UCRL-ID--123530; ON: DE96010716
- Country of Publication:
- United States
- Language:
- English
Similar Records
A subzone reconstruction algorithm for efficient staggered compatible remapping
Multi-material swept face remapping on polyhedral meshes
RHALE: A MMALE shock physics code for arbitrary meshes
Journal Article
·
Tue Sep 01 00:00:00 EDT 2015
· Journal of Computational Physics
·
OSTI ID:22465649
Multi-material swept face remapping on polyhedral meshes
Journal Article
·
Tue Aug 23 20:00:00 EDT 2022
· Journal of Computational Physics
·
OSTI ID:1885745
RHALE: A MMALE shock physics code for arbitrary meshes
Conference
·
Sat Aug 01 00:00:00 EDT 1992
·
OSTI ID:10161678