arXiv subjects

Michael Bauerheim

Publications and source records attributed to Michael Bauerheim.

9 recordsLinked to original sources

arXiv2025

Towards scalable surrogate models based on Neural Fields for large scale aerodynamic simulations

This paper introduces a novel surrogate modeling framework for aerodynamic applications based on Neural Fields. The proposed approach, MARIO (Modulated Aerodynamic Resolution Invariant Operator), addresses non parametric geometric variability through an efficient shape encoding mechanism and exploits the discretization-invariant nature of Neural Fields. It enables training on significantly downsampled meshes, while maintaining consistent accuracy during full-resolution inference. These properties allow for efficient modeling of diverse flow conditions, while reducing computational cost and memory requirements compared to traditional CFD solvers and existing surrogate methods. The framework is validated on two complementary datasets that reflect industrial constraints. First, the AirfRANS dataset consists in a two-dimensional airfoil benchmark with non-parametric shape variations. Performance evaluation of MARIO on this case demonstrates an order of magnitude improvement in prediction accuracy over existing methods across velocity, pressure, and turbulent viscosity fields, while accurately capturing boundary layer phenomena and aerodynamic coefficients. Second, the NASA Common Research Model features three-dimensional pressure distributions on a full aircraft surface mesh, with parametric control surface deflections. This configuration confirms MARIO's accuracy and scalability. Benchmarking against state-of-the-art methods demonstrates that Neural Field surrogates can provide rapid and accurate aerodynamic predictions under the computational and data limitations characteristic of industrial applications.

physics.flu-dyn↗

arXiv2025

Geometry aware inference of steady state PDEs using Equivariant Neural Fields representations

Advances in neural operators have introduced discretization invariant surrogate models for PDEs on general geometries, yet many approaches struggle to encode local geometric structure and variable domains efficiently. We introduce enf2enf, a neural field approach for predicting steady-state PDEs with geometric variability. Our method encodes geometries into latent features anchored at specific spatial locations, preserving locality throughout the network. These local representations are combined with global parameters and decoded to continuous physical fields, enabling effective modeling of complex shape variations. Experiments on aerodynamic and structural benchmarks demonstrate competitive or superior performance compared to graph-based, neural operator, and recent neural field methods, with real-time inference and efficient scaling to high-resolution meshes.

cs.LG↗

arXiv2025

Do you understand epistemic uncertainty? Think again! Rigorous frequentist epistemic uncertainty estimation in regression

Quantifying model uncertainty is critical for understanding prediction reliability, yet distinguishing between aleatoric and epistemic uncertainty remains challenging. We extend recent work from classification to regression to provide a novel frequentist approach to epistemic and aleatoric uncertainty estimation. We train models to generate conditional predictions by feeding their initial output back as an additional input. This method allows for a rigorous measurement of model uncertainty by observing how prediction responses change when conditioned on the model's previous answer. We provide a complete theoretical framework to analyze epistemic uncertainty in regression in a frequentist way, and explain how it can be exploited in practice to gauge a model's uncertainty, with minimal changes to the original architecture.

stat.ML↗

arXiv2024

Aero-Nef: Neural Fields for Rapid Aircraft Aerodynamics Simulations

This paper presents a methodology to learn surrogate models of steady state fluid dynamics simulations on meshed domains, based on Implicit Neural Representations (INRs). The proposed models can be applied directly to unstructured domains for different flow conditions, handle non-parametric 3D geometric variations, and generalize to unseen shapes at test time. The coordinate-based formulation naturally leads to robustness with respect to discretization, allowing an excellent trade-off between computational cost (memory footprint and training time) and accuracy. The method is demonstrated on two industrially relevant applications: a RANS dataset of the two-dimensional compressible flow over a transonic airfoil and a dataset of the surface pressure distribution over 3D wings, including shape, inflow condition, and control surface deflection variations. On the considered test cases, our approach achieves a more than three times lower test error and significantly improves generalization error on unseen geometries compared to state-of-the-art Graph Neural Network architectures. Remarkably, the method can perform inference five order of magnitude faster than the high fidelity solver on the RANS transonic airfoil dataset. Code is available at https://gitlab.isae-supaero.fr/gi.catalani/aero-nepf

cs.CE↗

arXiv2021

Using neural networks to solve the 2D Poisson equation for electric field computation in plasma fluid simulations

The Poisson equation is critical to get a self-consistent solution in plasma fluid simulations used for Hall effect thrusters and streamer discharges, since the Poisson solution appears as a source term of the unsteady nonlinear flow equations. As a first step, solving the 2D Poisson equation with zero Dirichlet boundary conditions using a deep neural network is investigated using multiple-scale architectures, defined in terms of number of branches, depth and receptive field. One key objective is to better understand how neural networks learn the Poisson solutions and provide guidelines to achieve optimal network configurations, especially when coupled to the time-varying Euler equations with plasma source terms. Here, the Receptive Field is found critical to correctly capture large topological structures of the field. The investigation of multiple architectures, losses, and hyperparameters provides an optimal network to solve accurately the steady Poisson problem. The performance of the optimal neural network solver, called PlasmaNet, is then monitored on meshes with increasing number of nodes, and compared with classical parallel linear solvers. Next, PlasmaNet is coupled with an unsteady Euler plasma fluid equations solver in the context of the electron plasma oscillation test case. In this time-evolving problem, a physical loss is necessary to produce a stable simulation. PlasmaNet is finally tested on a more complex case of discharge propagation involving chemistry and advection. The guidelines established in previous sections are applied to build the CNN to solve the same Poisson equation in cylindrical coordinates with different boundary conditions. Results reveal good CNN predictions and pave the way to new computational strategies using modern GPU-based hardware to predict unsteady problems involving a Poisson equation.

cs.LG↗

arXiv2021

Effects of boundary conditions in fully convolutional networks for learning spatio-temporal dynamics

Accurate modeling of boundary conditions is crucial in computational physics. The ever increasing use of neural networks as surrogates for physics-related problems calls for an improved understanding of boundary condition treatment, and its influence on the network accuracy. In this paper, several strategies to impose boundary conditions (namely padding, improved spatial context, and explicit encoding of physical boundaries) are investigated in the context of fully convolutional networks applied to recurrent tasks. These strategies are evaluated on two spatio-temporal evolving problems modeled by partial differential equations: the 2D propagation of acoustic waves (hyperbolic PDE) and the heat equation (parabolic PDE). Results reveal a high sensitivity of both accuracy and stability on the boundary implementation in such recurrent tasks. It is then demonstrated that the choice of the optimal padding strategy is directly linked to the data semantics. Furthermore, the inclusion of additional input spatial context or explicit physics-based rules allows a better handling of boundaries in particular for large number of recurrences, resulting in more robust and stable neural networks, while facilitating the design and versatility of such networks.

cs.LG↗

arXiv2017

Saturation of a turbulent mixing layer over a cavity: response to harmonic forcing around mean flows

Turbulent mixing layers over cavities can couple with acoustic waves and lead to undesired oscillations. To understand the nonlinear aspects of this phenomenon, a turbulent mixing layer over a deep cavity at Reynolds number 150 000 is considered and its response to harmonic forcing is analysed with large-eddy simulations (LES) and linearised Navier-Stokes equations (LNSE). As a model of incoming acoustic perturbations, spatially uniform time-harmonic forcing is applied at the cavity end, with amplitudes in the wide range 0.045-8.9% of the bulk velocity. Compressible LES provide reference nonlinear responses of the shear layer, and the associated mean flows. Linear responses are calculated with the incompressible LNSE around the LES mean flows; they predict well the amplification (both measured with kinetic energy and with a proxy for vortex sound production) and capture the nonlinear saturation observed as the forcing amplitude increases and the mixing layer thickens. Perhaps surprisingly, LNSE calculations based on a monochromatic (single frequency) assumption yield a good agreement even though higher harmonics and their nonlinear interaction (Reynolds stresses) are not negligible. However, the leading Reynolds stresses do not force the mixing layer efficiently, as shown by a comparison with the optimal volume forcing obtained in a resolvent analysis. Thus, they cannot fully benefit from the potential for amplification available in the flow. Finally, the sensitivity of the optimal harmonic forcing at the cavity end is computed with an adjoint method. The sensitivities to mean flow modification and to a localised feedback (structural sensitivity) both identify the upstream cavity corner as the region where a small-amplitude modification has the strongest effect. This can guide in a systematic way the design of strategies for the control of amplification and saturation mechanisms.

physics.flu-dyn↗

arXiv2016

Stability analysis of thermo-acoustic nonlinear eigenproblems in annular combustors. Part I. Sensitivity

We present an adjoint-based method for the calculation of eigenvalue perturbations in nonlinear, degenerate and non self-adjoint eigenproblems. This method is applied to a thermo-acoustic annular combustor network, the stability of which is governed by a nonlinear eigenproblem. We calculate the first- and second-order sensitivities of the growth rate and frequency to geometric, flow and flame parameters. Three different configurations are analysed. The benchmark sensitivities are obtained by finite difference, which involves solving the nonlinear eigenproblem at least as many times as the number of parameters. By solving only one adjoint eigenproblem, we obtain the sensitivities to any thermo-acoustic parameter, which match the finite-difference solutions at much lower computational cost.

physics.flu-dyn↗

arXiv2016

Stability analysis of thermo-acoustic nonlinear eigenproblems in annular combustors. Part II. Uncertainty quantification

Monte Carlo and Active Subspace Identification methods are combined with first- and second-order adjoint sensitivities to perform (forward) uncertainty quantification analysis of the thermo-acoustic stability of two annular combustor configurations. This method is applied to evaluate the risk factor, i.e., the probability for the system to be unstable. It is shown that the adjoint approach reduces the number of nonlinear-eigenproblem calculations by up to $\sim\mathcal{O}(M)$, as many as the Monte Carlo samples.

physics.flu-dyn↗