Abstract

Adaptivity is crucial for addressing practical challenges of the next decades. In this regard, recent surveys [117] highlight that it continues to be a major bottleneck in computational fluid dynamics workflow. We introduce mixed non-conforming discontinuous Galerkin discretization for the full Boltzmann equation in 2D/3D. These schemes have been designed for efficiency — motivated in part by spectral and isogeometric weighted collocation methods — and retain an optimal O(p+1) convergence for a p order approximation for non-linear kinetic systems on non-orthogonal grids. In this setting, it is possible to analyze highly complex problems of industrial strength i.e., structured, unstructured, mixed, irregular, multi-domain (multi-block) adaptive geometries at massively parallel scale (ten thousand cores or beyond). Mixed domains permit flexible mesh generation, whereas local nature of discontinuous Galerkin permits construction of adaptive numerical schemes that scale well. To address flows in mixing regime (low/high rarefaction), we couple the scheme with an asymptotic preserving implicit-explicit time discretization. These schemes are iteration free and applicable for a wide range of rarefied flows from free-molecular to continuum. To ensure stability in presence of shocks, we describe a method of constructing limiters on non-conforming grids. Finally, we show that the computational overhead for solving kinetic equations on non-conforming structured/unstructured domains is negligible relative to conforming domains. So, there is no reason to not prefer non-conforming unstructured domains.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.