Fast Mesh-to-Mesh Remaps Using Hash Algorithms
DOI10.1137/16M109140XzbMath1394.65158OpenAlexW2818427150MaRDI QIDQ3174777
Colin Redman, Gerald Collom, Robert 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
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Numerical algorithms for specific classes of architectures (65Y10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The PDE framework Peano applied to fluid dynamics: an efficient implementation of a parallel multiscale fluid dynamics solver on octree-like adaptive Cartesian grids
- Conservative remapping and region overlays by intersecting arbitrary polyhedra
- A parallel rendezvous algorithm for interpolation between multiple grids.
- Hash-Based Algorithms for Discretized Data
- Dynamically Adaptive Simulations with Minimal Memory Requirement—Solving the Shallow Water Equations Using Sierpinski Curves
- p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees
- Peano—A Traversal and Storage Scheme for Octree-Like Adaptive Cartesian Multiscale Grids
- Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
- Parallel Compact Hash Algorithms for Computational Meshes
- Statistical optimization of octree searches
- A cache‐oblivious self‐adaptive full multigrid method
- Multidimensional binary search trees used for associative searching
- The Peano Software—Parallel, Automaton-based, Dynamically Adaptive Grid Traversals
- Region representation
This page was built for publication: Fast Mesh-to-Mesh Remaps Using Hash Algorithms
