A fully-differentiable compressible high-order computational fluid dynamics solver
Not on the map. Why?
Abstract (arXiv)
Fluid flows are omnipresent in nature and engineering disciplines. The reliable computation of fluids has been a long-lasting challenge due to nonlinear interactions over multiple spatio-temporal scales. The compressible Navier-Stokes equations govern compressible flows and allow for complex phenomena like turbulence and shocks. Despite tremendous progress in hardware and software, capturing the smallest length-scales in fluid flows still introduces prohibitive computational cost for real-life applications. We are currently witnessing a paradigm shift towards machine learning supported design of numerical schemes as a means to tackle aforementioned problem. While prior work has explored differentiable algorithms for one- or two-dimensional incompressible fluid flows, we present a fully-differentiable three-dimensional framework for the computation of compressible fluid flows using high-order state-of-the-art numerical methods. Firstly, we demonstrate the efficiency of our solver by computing classical two- and three-dimensional test cases, including strong shocks and transition to turbulence. Secondly, and more importantly, our framework allows for end-to-end optimization to improve existing numerical schemes inside computational fluid dynamics algorithms. In particular, we are using neural networks to substitute a conventional numerical flux function.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 4 of its 27 references that are in the map. First posted on arXiv 9 Dec 2021.
Builds on
4 of 27 references.
References · 4
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2019Machine Learning for Fluid Mechanicscited by 380
- 2020Enhancement of shock-capturing methods via machine learningcited by 16
- 2021Consistent and symmetry preserving data-driven interface reconstruction for the level-set methodcited by 5
Built on by
Citing papers per year: 2022: 1; 2023: 1.
2 papers.