Abstract
Although data-driven methods have shown high accuracy as closure models for simulating turbulent flames, these models are often criticized for lack of physical interpretability, wherein they provide answers but no insight into their underlying rationale. In this work, we show that two interpretable machine learning algorithms, namely the random forest regressor and the sparse symbolic regression, can offer opportunities for discovering analytic expressions for subgrid-scale (SGS) terms of a turbulent transcritical flame. These transcritical conditions are found in various combustion systems that operate under high pressures that surpass the thermodynamic critical limit of fuel-oxidizer mixtures, and require the consideration of complex fluid behaviors that can cast doubts on the validity of existing subgrid-scale (SGS) models in large-eddy simulations. To this end, direct numerical simulations (DNS) of transcritical liquid-oxygen/gaseous-methane (LOX/GCH4) inert and reacting flows are performed. Using this data, a priori analysis is performed on the Favre-filtered DNS data to compare the accuracy of random forest SGS-models with conventional physics-based SGS-models. SGS stresses calculated with the gradient model are shown to have good agreement with the exact terms extracted from filtered DNS. Results demonstrate that random forests can perform as effectively as algebraic models when modeling subgrid stresses, when trained on a sufficiently representative database and with a suitable choice of the feature set. The employment of the random forest feature importance score is shown to enable the discovery of a analytic model for subgrid-scale stresses through sparse symbolic regression. The generalizability of random forest and sparse symbolic regression is demonstrated by modeling the subgrid-scale temperature, a term that arises from filtering the non-linear real-fluid equation-of-state, with good accuracy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.