Parallel Tree Algorithms for AMR and Non-Standard Data Access

DOI10.1145/3401990zbMath1486.65277arXiv1803.08432OpenAlexW3104646831WikidataQ111896860 ScholiaQ111896860MaRDI QIDQ5066576

Carsten Burstedde

Publication date: 29 March 2022

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

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

zbMATH Keywords

adaptive mesh refinementparticle trackingforest of octrees

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (4)

The \texttt{deal.II} library, version 9.4 ⋮ The \texttt{deal.II} library, version 9.5 ⋮ The deal.II library, Version 9.1 ⋮ An Optimized, Parallel Computation of the Ghost Layer for Adaptive Hybrid Forest Meshes

This page was built for publication: Parallel Tree Algorithms for AMR and Non-Standard Data Access