Fast mesh-to-mesh remaps using hash algorithms

DOI10.1137/16M109140XMaRDI QIDQ3174777zbMATH OpenOpenAlexFDO

Authors Gerald Collom, Colin Redman, Robert W. Robey

Publication date 18 July 2018

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/16m109140x

zbMATH Keywords

algorithmsremaphashingparallelAMR\(N\)-body

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Parallel algorithms in computer science (68W10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Hash-based algorithms for discretized data
• Parallel compact hash algorithms for computational meshes
• Fast optimization-based conservative remap of scalar fields through aggregate mass transfer
• Conservative remapping and region overlays by intersecting arbitrary polyhedra
• scientific article; zbMATH DE number 1304272

Cites work

• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• A cache‐oblivious self‐adaptive full multigrid method
• A parallel rendezvous algorithm for interpolation between multiple grids.
• Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
• Conservative remapping and region overlays by intersecting arbitrary polyhedra
• Dynamically adaptive simulations with minimal memory requirement-solving the shallow water equations using Sierpiński curves
• Hash-based algorithms for discretized data
• Introduction to algorithms.
• Multidimensional binary search trees used for associative searching
• Parallel compact hash algorithms for computational meshes
• Peano -- a traversal and storage scheme for octree-like adaptive Cartesian multiscale grids
• Region representation
• Statistical optimization of octree searches
• The PDE framework Peano applied to fluid dynamics: an efficient implementation of a parallel multiscale fluid dynamics solver on octree-like adaptive Cartesian grids
• The Peano software -- parallel, automaton-based, dynamically adaptive grid traversals
• p4est: scalable algorithms for parallel adaptive mesh refinement on forests of octrees

Cited in

(2)

• Parallel compact hash algorithms for computational meshes
• Hash-based algorithms for discretized data

Describes a project that uses

Uses Software

• DTK
• STREAM
• Peano
• RAGE
• p4est

This page was built for publication: Fast mesh-to-mesh remaps using hash algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174777)