Realizability-Constrained Machine Learning for Turbulence Closures in Wake Flows
Talib Ansari, Priyank H. Mehta, Harshal D. Akolekar

TL;DR
This paper introduces a CFD-driven machine learning framework that enforces realizability and stability constraints, significantly improving turbulence model discovery for wake flows with enhanced efficiency and physical consistency.
Contribution
It develops a residual- and realizability-filtered gene expression programming framework that reduces computational cost and ensures physically admissible turbulence models during training.
Findings
Achieved 42.3% reduction in computational cost.
Reduced non-realizable models at convergence from 58.4% to 1.7%.
Enhanced wake prediction accuracy and robustness across diverse geometries.
Abstract
Computational fluid dynamics (CFD)-driven machine learning frameworks based on symbolic regression offer a promising pathway for turbulence model discovery, but are often hindered by numerical instability, residual stagnation, and non-physical model behavior during training. In particular, realizability, which is rarely enforced explicitly during model development, remains a critical yet overlooked requirement, especially for accurate wake prediction. In this work, a residual- and realizability-filtered CFD-driven framework is proposed to enhance both efficiency and robustness within a gene expression programming (GEP) paradigm. The method integrates two residual-based filtering criteria along with a barycentric-map-based realizability constraint directly into the CFD solution loop, enabling early identification and rejection of unstable and non-realizable candidate models. This reduces…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
