Scalable adaptive PDE solvers in arbitrary domains

Abstract

Efficiently and accurately simulating partial differential equations (PDEs) in and around arbitrarily defined geometries, especially with high levels of adaptivity, has significant implications for different application domains. A key bottleneck in the above process is the fast construction of a `good' adaptively-refined mesh. In this work, we present an efficient novel octree-based adaptive discretization approach capable of carving out arbitrarily shaped void regions from the parent domain: an essential requirement for fluid simulations around complex objects. Carving out objects produces an $\text{incomplete}$ octree. We develop efficient top-down and bottom-up traversal methods to perform finite element computations on $\text{incomplete}$ octrees. We validate the framework by (a) showing appropriate convergence analysis and (b) computing the drag coefficient for flow past a sphere for a wide range of Reynolds numbers ($\mathcal{O}(1-10^6)$) encompassing the drag crisis regime. Finally, we deploy the framework on a realistic geometry on a current project to evaluate COVID-19 transmission risk in classrooms.

arXiv comment16 pages. Accepted for publication at Supercomputing '21: The International Conference for High Performance Computing, Networking, Storage, and Analysis

References in corpus (5)

• An Immersed Boundary Method with Direct Forcing for the Simulation of Particulate Flows
• Afivo: a framework for quadtree/octree AMR with shared-memory parallelization and geometric multigrid methods
• Massively Parallel Simulations of Binary Black Hole Intermediate-Mass-Ratio Inspirals
• The Peano software - parallel, automaton-based, dynamically adaptive grid traversals
• Industrial scale large eddy simulations (LES) with adaptive octree meshes using immersogeometric analysis

Cited by in corpus (1)

• A projection-based, semi-implicit time-stepping approach for the Cahn-Hilliard Navier-Stokes equations on adaptive octree meshes