An official website of the United States government
A local-sensitivity-analysis technique is employed to generate new skeletal reaction models for methane combustion from the foundational fuel chemistry model (FFCM-1). The sensitivities of the thermo-chemical variables with respect to the reaction rates are computed via the forced-optimally time dependent (f-OTD) methodology. In this methodology, the large sensitivity matrix containing all local sensitivities is modeled as a product of two low-rank time-dependent matrices. The evolution equations of these matrices are derived from the governing equations of the system. The modeled sensitivities are computed for the auto-ignition of methane at atmospheric and high pressures with different sets of initial temperatures, and equivalence ratios. These sensitivities are then analyzed to rank the most important (sensitive) species. A series of skeletal models with different number of species and levels of accuracy in reproducing the FFCM-1 results are suggested. The performances of the generated models are compared against FFCM-1 in predicting the ignition delay, the laminar flame speed, and the flame extinction. The results of this comparative assessment suggest the skeletal models with 24 and more species generate the FFCM-1 results with an excellent accuracy.
more »
« less
This content will become publicly available on April 16, 2026
On-the-fly reduced-order modelling of the filter density function with time-dependent subspaces
A dynamical low-rank approximation is developed for reduced-order modelling (ROM) of the filtered density function (FDF) transport equation, which is utilised for large eddy simulation (LES) of turbulent reacting flows. In this methodology, the evolution of the composition matrix describing the FDF transport via a set of Langevin equations is con- strained to a low-rank matrix manifold. The composition matrix is approximated using a low-rank factorisation, which consists of two thin, time-dependent matrices repre- senting spatial and composition bases, along with a small time-dependent coefficient matrix. The evolution equations for spatial and composition subspaces are derived by projecting the composition transport equation onto the tangent space of the low-rank matrix manifold. Unlike conventional ROMs, such as those based on principal com- ponent analysis, both subspaces are time-dependent and the ROM does not require any prior data to extract the low-dimensional subspaces. As a result, the constructed ROM adapts on the fly to changes in the dynamics. For demonstration, LES via the time-dependent bases (TDB) is conducted of the canonical configuration of a tempo- rally developing planar CO/H2 jet flame. The flame is rich with strong flame-turbulence interactions resulting in local extinction followed by re-ignition. The combustion chem- istry is modelled via the skeletal kinetics, containing 11 species with 21 reaction steps. It is shown that the FDF-TDB yields excellent predictions of various sta
more »
« less
- PAR ID:
- 10648336
- Editor(s):
- CTM
- Publisher / Repository:
- CTM
- Date Published:
- Journal Name:
- Combustion Theory and Modelling
- Volume:
- 29
- Issue:
- 3
- ISSN:
- 1364-7830
- Page Range / eLocation ID:
- 359 to 377
- Subject(s) / Keyword(s):
- time-dependent subspaces reduced-order modelling turbulent combus- tion LES FDF
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Low-dimensional and computationally less-expensive reduced-order models (ROMs) have been widely used to capture the dominant behaviors of high-4dimensional systems. An ROM can be obtained, using the well-known proper orthogonal decomposition (POD), by projecting the full-order model to a subspace spanned by modal basis modes that are learned from experimental, simulated, or observational data, i.e., training data. However, the optimal basis can change with the parameter settings. When an ROM, constructed using the POD basis obtained from training data, is applied to new parameter settings, the model often lacks robustness against the change of parameters in design, control, and other real-time operation problems. This paper proposes to use regression trees on Grassmann manifold to learn the mapping between parameters and POD bases that span the low-dimensional subspaces onto which full-order models are projected. Motivated by the observation that a subspace spanned by a POD basis can be viewed as a point in the Grassmann manifold, we propose to grow a tree by repeatedly splitting the tree node to maximize the Riemannian distance between the two subspaces spanned by the predicted POD bases on the left and right daughter nodes. Five numerical examples are presented to comprehensively demonstrate the performance of the proposed method, and compare the proposed tree-based method to the existing interpolation method for POD basis and the use of global POD basis. The results show that the proposed tree-based method is capable of establishing the mapping between parameters and POD bases, and thus adapt ROMs for new parameters.more » « less
-
Taylor and Francis (Ed.)A new computational methodology, termed ‘PeleLM-FDF’ is developed and utilised for high fidelity large eddy simulation (LES) of complex turbulent combustion systems. This methodology is constructed via a hybrid scheme combining the Eulerian PeleLM base flow solver with the Lagrangian Monte Carlo simulator of the filtered density func- tion (FDF) for the subgrid scale reactive scalars. The resulting methodology is capable of simulating some of the most intricate physics of complex turbulence-combustion interactions. This is demonstrated by LES of a non-premixed CO/H2 temporally evolv- ing jet flame. The chemistry is modelled via a skeletal kinetics model, and the results are appraised via a posteriori comparisons against direct numerical simulation (DNS) data of the same flame. Excellent agreements are observed for the time evolution of various statistics of the thermo-chemical quantities, including the manifolds of the multi-scalar mixing. The new methodology is capable of capturing the complex phe- nomena of flame-extinction and re-ignition at a 1/512 of the computational cost of the DNS. The high fidelity and the computational affordability of the new PeleLM-FDF solver warrants its consideration for LES of practical turbulent combustion systems.more » « less
-
Abstract Data assimilation methods often also employ the same discrete dynamical model used to evolve the state estimate in time to propagate an approximation of the state estimation error covariance matrix. Four‐dimensional variational methods, for instance, evolve the covariance matrix implicitly via discrete tangent linear dynamics. Ensemble methods, while not forming this matrix explicitly, approximate its evolution at low rank from the evolution of the ensemble members. Such approximate evolution schemes for the covariance matrix imply an approximate evolution of the estimation error variances along its diagonal. For states that satisfy the advection equation, the continuity equation, or related hyperbolic partial differential equations (PDEs), the estimation error variance itself satisfies a known PDE, so the accuracy of the various approximations to the variances implied by the discrete covariance propagation can be determined directly. Experiments conducted by the atmospheric chemical constituent data assimilation community have indicated that such approximate variance evolution can be highly inaccurate. Through careful analysis and simple numerical experiments, we show that such poor accuracy must be expected, due to the inherent nature of discrete covariance propagation, coupled with a special property of the continuum covariance dynamics for states governed by these types of hyperbolic PDE. The intuitive explanation for this inaccuracy is that discrete covariance propagation involves approximating diagonal elements of the covariance matrix with combinations of off‐diagonal elements, even when there is a discontinuity in the continuum covariance dynamics along the diagonal. Our analysis uncovers the resulting error terms that depend on the ratio of the grid spacing to the correlation length, and these terms become very large when correlation lengths begin to approach the grid scale, for instance, as gradients steepen near the diagonal. We show that inaccurate variance evolution can manifest itself as both spurious loss and gain of variance.more » « less
-
Models in which the covariance matrix has the structure of a sparse matrix plus a low rank perturbation are ubiquitous in data science applications. It is often desirable for algorithms to take advantage of such structures, avoiding costly matrix computations that often require cubic time and quadratic storage. This is often accomplished by performing operations that maintain such structures, for example, matrix inversion via the Sherman–Morrison–Woodbury formula. In this article, we consider the matrix square root and inverse square root operations. Given a low rank perturbation to a matrix, we argue that a low‐rank approximate correction to the (inverse) square root exists. We do so by establishing a geometric decay bound on the true correction's eigenvalues. We then proceed to frame the correction as the solution of an algebraic Riccati equation, and discuss how a low‐rank solution to that equation can be computed. We analyze the approximation error incurred when approximately solving the algebraic Riccati equation, providing spectral and Frobenius norm forward and backward error bounds. Finally, we describe several applications of our algorithms, and demonstrate their utility in numerical experiments.more » « less
