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 octree. We develop efficient top-down and bottom-up traversal methods to perform finite element computations on 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 () 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.
Cite
@article{arxiv.2108.03757,
title = {Scalable adaptive PDE solvers in arbitrary domains},
author = {Kumar Saurabh and Masado Ishii and Milinda Fernando and Boshun Gao and Kendrick Tan and Ming-Chen Hsu and Adarsh Krishnamurthy and Hari Sundar and Baskar Ganapathysubramanian},
journal= {arXiv preprint arXiv:2108.03757},
year = {2021}
}
Comments
16 pages. Accepted for publication at Supercomputing '21: The International Conference for High Performance Computing, Networking, Storage, and Analysis