Coarse Mesh Partitioning for Tree-Based AMR

DOI10.1137/16M1103518zbMath1377.65126arXiv1611.02929MaRDI QIDQ4594181

Johannes Holke, Carsten Burstedde

Publication date: 17 November 2017

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

Full work available at URL: https://arxiv.org/abs/1611.02929

zbMATH Keywords

adaptive mesh refinementparallel algorithmshigh-performance computingmesh partitioningcoarse meshforest of octrees

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)

Related Items (2)

An efficient adaptive mesh refinement (AMR) algorithm for the discontinuous Galerkin method: applications for the computation of compressible two-phase flows ⋮ An Optimized, Parallel Computation of the Ghost Layer for Adaptive Hybrid Forest Meshes

Uses Software

• Gmsh
• SIERRA
• deal.ii
• TetGen
• p4est
• PT-Scotch
• Zoltan
• Triangle
• Peano
• Racoon
• GAMER
• Pyramid
• PUMI
• ForestClaw
• samoa2

Cites Work

• Unnamed Item
• Parallel level-set methods on adaptive tree-based grids
• Adaptive mesh refinement for hyperbolic partial differential equations
• Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves
• A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
• Adaptive grid refinement for numerical wather prediction
• Local adaptive mesh refinement for shock hydrodynamics
• Fast optimal load balancing algorithms for 1D partitioning
• Parallel unstructured mesh generation by an advancing front method
• A Tetrahedral Space-Filling Curve for Nonconforming Adaptive Meshes
• Space-Filling Curves
• Recursive Algorithms for Distributed Forests of Octrees
• 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
• Parallel Memory-Efficient Adaptive Mesh Refinement on Structured Triangular Meshes with Billions of Grid Cells
• Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
• Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves
• deal.II—A general-purpose object-oriented finite element library
• Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities
• On a Data Structure for Adaptive Finite Element Mesh Refinements
• A‐posteriori error estimates for the finite element method
• Controlling Unstructured Mesh Partitions for Massively Parallel Simulations
• PUMI

This page was built for publication: Coarse Mesh Partitioning for Tree-Based AMR