physics.flu-dynOct 3, 2025

oRANS: Online optimisation of RANS machine learning models with embedded high-fidelity data generation

Authors: Daniel Dehtyriov, Jonathan F. MacArt, Justin Sirignano

Organizations: Mathematical Institute, University of Oxford, Andrew Wiles Building, Woodstock Rd, Oxford, OX2 6GG, United Kingdom · Department of Aerospace and Mechanical Engineering, University of Notre Dame, 369 Fitzpatrick Hall of Engineering, Notre Dame, IN 46556, USA

Abstract

Deep learning (DL) has shown promise for flow simulations, but progress is constrained by the scarcity of high-fidelity training data, which is costly to generate and limited to few flow conditions. Closures trained offline on such data tend to overfit and fail to generalise to new regimes. We introduce an online optimisation framework for DL-based Reynolds-averaged Navier-Stokes (RANS) closures. Training data is generated by a simulation at direct numerical simulation (DNS) resolution embedded in a subdomain of the RANS domain. The RANS solution supplies boundary conditions to the embedded simulation, which provides the mean velocity and turbulence statistics used to update the closure, which thereby adapts to the target flow without precomputed datasets. The approach is developed on the stochastically forced Burgers equation and on turbulent channel flow at Reτ=180Re_τ=180, 270, 395 and 590 with embedded domain lengths 1≤L0/L≤81\leq L_0/L\leq 8, and is then applied to spanwise-rotating channel flow at Rob=0.15Ro_b=0.15 and 0.50.5, a flow in which the Coriolis force vanishes from the equations of a linear eddy-viscosity closure. Online-optimised RANS models outperform offline-trained and literature-calibrated closures with modest embedded subdomains, and in the rotating channel recover the rotation-induced asymmetry from non-rotating inflow turbulence and a rotation-blind closure. The learned coefficients are interpretable, recovering near-wall damping and, under rotation, the collapse of the eddy viscosity on the stabilised side. Performance degrades when boundary contamination dominates or domains are too short to capture low-wavenumber modes. This framework provides a route to data-adaptive machine learning closures without large precomputed training datasets.

Figures & tables

Appendix figures & tables5 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

May 25, 2026

Deep Learning-based Algebraic Reynolds Stress Closures for RANS Simulations of Turbulent Flows

Turbulence is ubiquitous in engineering and science, yet direct simulation is prohibitively expensive. The Reynolds-averaged Navier-Stokes (RANS) equations provide savings exceeding ten orders of magnitude but introduce unclosed terms (the closure problem). Offline-trained machine-learning (ML) closures suffer distribution shift in predictive simulations, while ML methods that bypass the governing equations struggle to generalise from scarce high-fidelity data. We develop a physics-derived deep learning closure model for RANS, the Deep Algebraic Reynolds Stress Model (DARSM), which can be trained on small datasets and accurately generalise across Reynolds numbers, to unseen geometries, and to different flow regimes. A neural network maps flow invariants to empirical parameters in an implicit algebraic Reynolds stress equation, derived from the Reynolds stress transport equations under the weak-equilibrium assumption, imposing physics-based structure on the ML closure. End-to-end optimisation through the governing PDEs and the coupled implicit closure eliminates distribution shift, but both unrolled and implicit automatic differentiation fail on the stiff coupled solver. We derive adjoint equations that exploit the solver's implicit-explicit structure for efficient optimisation. On canonical square-duct and periodic-hill benchmarks, DARSM reduces average test velocity error over baseline RANS by 22-4×4\times across Reynolds number, geometries, and flow regimes, with peak case-level reductions of 12×12\times. The model trained on attached, anisotropy-dominated flows (square duct) accurately generalises without retraining to separated flows (periodic hills), a regime change in the underlying physics. DARSM also outperforms five established ML methods: offline training, tensor-basis neural networks, field-inversion machine learning, DeepONets, and physics-informed neural networks.
Apr 26, 2026

Deep Learning of Solver-Aware Turbulence Closures from Nudged LES Dynamics

The differentiable physics paradigm may be leveraged as an a-posteriori approach for discovering turbulence closure models by embedding a neural network parameterization directly inside the solver and optimizing it given potentially sparse target data. This addresses a key limitation of a-priori learning where direct numerical simulation (DNS) data is used to approximate the subgrid stress with the assumption of a low-pass filter. Closures trained in this a-priori manner frequently lead to unstable deployments due to the mismatch between the assumed filter and the effect of numerical discretizations and coarse-graining. In comparison, while typically stable during deployment, a-posteriori learning incurs high computational costs due to the need to backpropagate through a large eddy simulation (LES) solver. Furthermore, a-posteriori methods are challenging to apply broadly since they require significant modification of existing solvers. Finally, both approaches are limited when generalization is desired across different numerical schemes with their implicit filtering characteristics. In this work, we present a deep-learning approach for turbulence closure modeling built on the continuous data assimilation framework. Our approach enables the a-priori training of closures using sparsely observed DNS data without modifying or differentiating through the LES solver, while preserving stability during deployment for the recovery of invariant statistics. We focus on the model's ability to adapt to different discretizations by explicitly conditioning it on the numerical scheme. We use two- and three-dimensional canonical cases to test our framework and show that the learned correction systematically tracks the discretization error of the coarse solver.
Nov 2, 2026

CFD-driven symbolic regression of RANS transition models

Laminar-turbulent transition governs skin friction, heat transfer and losses in turbomachinery, yet Reynolds-averaged Navier-Stokes (RANS) transition models rely on empirical correlations and hand-calibrated activation functions whose structural deficiencies cannot be resolved by recalibration. We propose a CFD-driven sparse symbolic regression framework to learn interpretable, closed-form corrections to the production and destruction activation functions in the intermittency equation of the local, Galilean-invariant kk-ωω-γγ model of Ge et al. Each correction combines a polynomial of a local pressure-gradient parameter, controlling amplitude and sign, with a bounded exponential of local flow features, controlling spatial support. This construction bounds the corrections without ad hoc limiters. Coefficients are identified by gradient-free optimization with the RANS solver in the loop, accelerated by POD-Kriging field surrogates, using mean-velocity data from wall-resolved large-eddy simulations (LES) of the ERCOFTAC T3 flat-plate cases. Elastic-net hyperparameters are selected automatically through bi-level optimization with leave-one-case-out cross-validation. The resulting model retains 11 of 21 candidate terms, compared with 20 under conventional grid-search tuning, while achieving comparable or slightly better accuracy on training and unseen cases. Both approaches recover the same leading-order correction. Applied without retraining to the transonic LS89 turbine cascade, far beyond the training envelope, the augmented model remains numerically robust and improves heat-transfer predictions at all four operating points, reducing errors by up to 70% where the baseline predicts premature transition under high freestream turbulence. Residual errors in transition onset and length highlight the limits of training on flat-plate data alone.