mlsanityData to 14 Oct 2026

Neural Basis Functions for Accelerating Solutions to High Mach Euler Equations

arXiv 2208.01687 ↗First posted 2 Aug 2022cs.LG cs.NA math.NAcited by 2

Not on the map. Why?

Abstract (arXiv)

We propose an approach to solving partial differential equations (PDEs) using a set of neural networks which we call Neural Basis Functions (NBF). This NBF framework is a novel variation of the POD DeepONet operator learning approach where we regress a set of neural networks onto a reduced order Proper Orthogonal Decomposition (POD) basis. These networks are then used in combination with a branch network that ingests the parameters of the prescribed PDE to compute a reduced order approximation to the PDE. This approach is applied to the steady state Euler equations for high speed flow conditions (mach 10-30) where we consider the 2D flow around a cylinder which develops a shock condition. We then use the NBF predictions as initial conditions to a high fidelity Computational Fluid Dynamics (CFD) solver (CFD++) to show faster convergence. Lessons learned for training and implementing this algorithm will be presented as well.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 27 references that are in the map. First posted on arXiv 2 Aug 2022.

Builds on

7 of 27 references.

References · 7

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,908
  4. 2015Automatic differentiation in machine learning: a surveycited by 855
  5. 2019DeepXDE: A deep learning library for solving differential equationscited by 619
  6. 2017Solving high-dimensional partial differential equations using deep learningcited by 556
  7. 2020Integrating Scientific Knowledge with Machine Learning for Engineering and Environmental Systemscited by 164

Built on by

Cited by year

Citing papers per year: 2023: 2.

2 papers.