SearcharxivSearch

arXiv subjects

Priyesh Kakka

Publications and source records attributed to Priyesh Kakka.

3 recordsLinked to original sources

Solver-in-the-loop training of deep learning closures for large-eddy simulation of turbulent premixed jet flames

Large-eddy simulation (LES) turbulence models often fail to capture the effects of chemical heat release and the resulting modulation of turbulence in premixed flames, underscoring the need for a framework that remains accurate across a broad range of physical regimes. We develop an augmented eddy-viscosity closure, based on deep neural networks calibrated jointly with the LES solution using adjoint-based optimization and differentiable programming, ensuring consistency with the governing partial differential equations (PDEs). Several objective functions and training methods are examined, and each model is assessed for its capability to interpolate and extrapolate across a wide range of Damk\"ohler numbers. Relative to the Smagorinsky-model baseline, the best neural network model improves a posteriori errors in the LES primitive variables by 25-50% and in the resolved Reynolds stress and scalar flux by more than 60%. Crucially, the model generalizes across Damk\"ohler number regimes, maintaining stability and accuracy even for out-of-sample conditions. These results demonstrate that PDE-consistent deep learning closures can recover both mean fields and resolved turbulence statistics in LES of turbulent premixed flames and can therefore provide a broadly applicable framework for turbulent combustion modeling.

physics.flu-dyn

Neural network-augmented eddy viscosity closures for turbulent premixed jet flames

Extending gradient-type turbulence closures to turbulent premixed flames is challenging due to the significant influence of combustion heat release. We incorporate a deep neural network (DNN) into Reynolds-averaged Navier--Stokes (RANS) models for the turbulent viscosity and thermal conductivity as nonlinear functions of the local flow state and thermochemical gradients. Our models are optimized over the RANS partial differential equations (PDEs) using an adjoint-based data assimilation procedure. Because we directly target the RANS solution, as opposed to the unclosed terms, successfully trained models are guaranteed to improve the in-sample accuracy of the DNN-augmented RANS predictions. We demonstrate the learned closures for in- and out-of-sample $\textit{a posteriori}$ RANS predictions of compressible, premixed, turbulent jet flames with turbulent Damköhler numbers spanning the gradient- and counter-gradient transport regimes. The DNN-augmented RANS predictions have one to two orders of magnitude lower spatiotemporal mean-squared error than those using a baseline $k$--$ε$ model, even for Damköhler numbers far from those used for training. This demonstrates the accuracy, stability, and generalizability of the PDE-constrained modeling approach for turbulent jet flames over this relatively wide Damköhler number range.

physics.flu-dyn

Sampling-based Distributed Training with Message Passing Neural Network

In this study, we introduce a domain-decomposition-based distributed training and inference approach for message-passing neural networks (MPNN). Our objective is to address the challenge of scaling edge-based graph neural networks as the number of nodes increases. Through our distributed training approach, coupled with Nyström-approximation sampling techniques, we present a scalable graph neural network, referred to as DS-MPNN (D and S standing for distributed and sampled, respectively), capable of scaling up to $O(10^5)$ nodes. We validate our sampling and distributed training approach on two cases: (a) a Darcy flow dataset and (b) steady RANS simulations of 2-D airfoils, providing comparisons with both single-GPU implementation and node-based graph convolution networks (GCNs). The DS-MPNN model demonstrates comparable accuracy to single-GPU implementation, can accommodate a significantly larger number of nodes compared to the single-GPU variant (S-MPNN), and significantly outperforms the node-based GCN.

cs.LG