Abstract
We address a turbulent deflagration model with a flow governed by the compositional Euler equations and the flame propagation represented by the transport of the characteristic function. The numerical scheme works on staggered, unstructured meshes with a time-marching algorithm solving first the chemical species mass balances and then the mass, momentum and energy balances. A pressure correction technique is used for this latter step, which solves a balance equation for the sensible enthalpy with corrective terms to ensure consistency of the total energy. The approximate solutions respect the physical bounds and satisfy a conservative weakly-consistent discrete total energy balance equation. Numerical evidence shows that they converge to the solution of the infinitely fast chemistry continuous problem when the chemical time scale tends to zero with the space and time steps.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beccantini, A., Studer, E.: The reactive Riemann problem for thermally perfect gases at all combustion regimes. Int. J. Numer. Meth. Fluids 64, 269–313 (2010)
CALIF\(^3\)S: A software components library for the computation of reactive turbulent flows. https://gforge.irsn.fr/gf/project/isis
Ciarlet, P.G.: Basic error estimates for elliptic problems. In: Ciarlet, P., Lions, J. (eds.) Handbook of Numerical Analysis, Vol. II, pp. 17–351. North Holland (1991)
Crouzeix, M., Raviart, P.: Conforming and nonconforming finite element methods for solving the stationary Stokes equations. RAIRO Série Rouge 7, 33–75 (1973)
Després, B., Lagoutière, F.: Contact discontinuity capturing scheme for linear advection and compressible gas dynamics. J. Sci. Comput. 16, 479–524 (2002)
Gastaldo, L., Herbin, R., Kheriji, W., Lapuerta, C., Latché, J.C.: Staggered discretizations, pressure correction schemes and all speed barotropic flows. In: Finite Volumes for Complex Applications VI - Problems & Perspectives - Prague, Czech Republic, vol. 2, pp. 39–56. Springer (2011)
Godlewski, E., Raviart, P.A.: Numerical Approximation of Hyperbolic Systems of Conservation Laws. No. 118 in Applied Mathematical Sciences. Springer, New York (1996)
Grapsas, D., Herbin, R., Kheriji, W., Latché, J.C.: An unconditionally stable finite element-finite volume pressure correction scheme for the compressible Navier-Stokes equations. SMAI J. Comput. Math. 2, 51–97 (2016)
Harlow, F., Amsden, A.: A numerical fluid dynamics calculation method for all flow speeds. J. Comput. Phys. 8, 197–213 (1971)
Harlow, F., Welsh, J.: Numerical calculation of time-dependent viscous incompressible flow of fluid with free surface. Phys. Fluids 8, 2182–2189 (1965)
Herbin, R., Kheriji, W., Latché, J.C.: On some implicit and semi-implicit staggered schemes for the shallow water and Euler equations. Math. Modelling Numer. Anal. 48, 1807–1857 (2014)
Herbin, R., Latché, J.C.: Kinetic energy control in the MAC discretisationof the compressible Navier-Stokes equations. Int. J. Finite Vol. 7 (2010)
Larrouturou, B.: How to preserve the mass fractions positivity when computing compressible multi-component flows. J. Comput. Phys. 95, 59–84 (1991)
Peters, N.: Turbulent Combustion. Cambridge University Press, Cambridge Monographs of Mechanics (2000)
Piar, L., Babik, F., Herbin, R., Latché, J.C.: A formally second order cell centered scheme for convection-diffusion equations on general grids. Int. J. Numer. Meth. Fluids 71, 873–890 (2013)
Poinsot, T., Veynante, D.: Theoretical and Numerical Combustion. Editions R.T Edwards Inc. (2005)
Rannacher, R., Turek, S.: Simple nonconforming quadrilateral Stokes element. Numer. Methods Partial Differ. Equ. 8, 97–111 (1992)
Zimont, V.: Gas premixed combustion at high turbulence. Turbulent flame closure combustion model. Experimental Thermal Fluid Sci. 21, 179–186 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
8 Appendix A: The MUSCL Scheme
The MUSCL discretization of the convection operators of the chemical species balance and G-equation closely follows the technique proposed in [15]. To present this discretization, we consider the following system of equations:
We suppose for short that this system is complemented by impermeability boundary conditions, i.e. that the normal velocity, both at the continuous and the discrete level, vanishes on the boundary of the computational domain.
The discretization of the above system reads:
For any \(\sigma \in {\mathcal E}\), the procedure consists in three steps:
-
calculate a tentative value for \(y_\sigma \) as a linear interpolate of nearby values,
-
calculate an interval for \(y_\sigma \) which guarantees the stability of the scheme,
-
project the tentative value \(y_\sigma \) on this stability interval.
For the tentative value of \(y_\sigma \), let us choose some real coefficients \((\alpha _K^\sigma )_{K\in {\mathcal M}}\) such that
The coefficients used in this interpolation are chosen in such a way that as few as possible cells, to be picked up in the closest cells to \(\sigma \), take part. For example, for \(\sigma =K|L\) and if \({\boldsymbol{x}}_K,\ {\boldsymbol{x}}_\sigma ,\ {\boldsymbol{x}}_L\) are aligned, only two non-zero coefficients exist in the family \((\alpha _K^\sigma )_{K\in {\mathcal M}}\), namely \(\alpha _K^\sigma \) and \(\alpha _L^\sigma \). Then, these coefficients are used to calculate the tentative value of \(y_\sigma \) by
The construction of the stability interval must be such that the following property holds:
Indeed, under this latter hypothesis and a CFL condition, the scheme preserves the initial bounds of y.
Remark 4
Note that, in Assumption (33), only internal faces are considered, since the fluxes through external faces are supposed to vanish. However, the present discussion may easily be generalized to cope with convection fluxes entering the domain.
Definition 1
The so-called CFL number reads for any \(0 \le n \le N\):
Lemma 3
Let us suppose that \(\mathrm{CFL}^{n+1}\le 1\). For \(K\in {\mathcal M}\), let us note by \(\mathcal V(K)\) the union of the set of cells \(M_K^\sigma ,\ \sigma \in {\mathcal E}(K) \cap {\mathcal E}_{\mathrm{int}}\) such that (33) holds. Then \(\forall K\in {\mathcal M}\), the value of \(y_K^{n+1}\) is a convex combination of \(\{y_K^n, (y_M^n)_{M\in \mathcal V(K)} \}\).
Proof The discrete mass balance equation yields:
Replacing this expression of \(\rho _K^n\) in the discrete balance equation of y and using the relations provided by (33), we obtain:
This relation yields
which concludes the proof under the hypothesis that \(\mathrm{CFL}\le 1\).
We now need to reformulate (33) in order to construct the stability interval. Let \(\sigma \in {\mathcal E}\), let us denote by \(V^-\) and \(V^+\) the upstream and downstream cell separated by \(\sigma \), and by \(\mathcal V_\sigma (V^-)\) and \(\mathcal V_\sigma (V^+)\) two sets of neighbouring cells of \(V^-\) and \(V^+\) respectively, and let us suppose:
where for \(a,\,b\in \mathbb R\), we denote by |[a, b]| the interval \(\{\alpha a + (1-\alpha )b,\ \alpha \in [0,1] \}\), and \(\zeta ^+\) and \(\zeta ^-\) are two numerical parameters lying in the interval [0, 2].
Conditions (H1)-(H2) and (33) are linked in the following way: let \(K\in {\mathcal M}\) and \(\sigma \in {\mathcal E}(K)\). If \(F_{K,\sigma }^n\le 0\), i.e. K is the downstream cell for \(\sigma \), denoted above by \(V^+\), since \(\zeta ^+\in [0,2]\), condition (H1) yields that there exists \(M\in {\mathcal M}\) such that \(u_\sigma ^n\in |[u_K^n,u_M^n]|\), which is (33). Otherwise, i.e. if \(F_{K,\sigma }^n\ge 0\) and K is the upstream cell for \(\sigma \), denoted above by \(V^-\), condition (H2) yields that there exists \(M\in {\mathcal M}\) such that \(y_\sigma ^n\in |[y_K^n,2y_K^n-y_M^n]|\), so \(y_\sigma ^n-y_K^n\in |[0,y_K^n-y_M^n]|\), which is once again (33).
Remark 5
For \(\sigma \in {\mathcal E}\), if \(V^-\in \mathcal V_\sigma (V^+)\), the upstream choice \(y_\sigma ^n=y_{V^-}^n\) always satisfies the conditions (H1)-(H2), and is the only one to satisfy them if we choose \(\zeta ^-=\zeta ^+=0\).
Remark 6
(1D case) Let us take the example of an interface \(\sigma \) separating \(K_i\) and \(K_{i+1}\) in a 1D case (see Fig. 10 for the notations), with a uniform meshing and a positive advection velocity, so that \(V^-=K_i\) and \(V^+=K_{i+1}\). In 1D, a natural choice is \(\mathcal V_\sigma (K_i)=\{K_{i-1}\}\) and \(\mathcal V_\sigma (K_{i+1})=\{K_i \}\). On Fig. 10, we sketch: on the left, the admissible interval given by (H1) with \(\zeta ^+=1\) (green) and \(\zeta ^+=2\) (orange); on the right, the admissible interval given by (H2) with \(\zeta ^-=1\) (green) and \(\zeta ^-=2\) (orange). The parameters \(\zeta ^-\) and \(\zeta ^+\) may be seen as limiting the admissible slope between \(({\boldsymbol{x}}_i,y^n_i)\) and \(({\boldsymbol{x}}_\sigma , y^n_\sigma )\) (with \({\boldsymbol{x}}_i\) the abscissa of the mass centre of \(K_i\) and \({\boldsymbol{x}}_\sigma \) the abscissa of \(\sigma \)), with respect to a left and right slope, respectively. For \(\zeta ^-=\zeta ^+=1\), one recognizes the usual minmod limiter (e.g. [7, Chapter III]). Note that, since, on the example depicted on Fig. 10, the discrete function \(y^n\) has an extremum in \(K_i\), the combination of the conditions (H1) and (H2) imposes that, as usual, the only admissible value for \(y^n_\sigma \) is the upwind one.
Finally, we need to specify the choice of the sets \(\mathcal V_\sigma (V^-)\) and \(\mathcal V_\sigma (V^+)\). Here, we just set \(\mathcal V_\sigma (V^+) = \{V^-\}\); such a choice guarantees that at least the upstream choice is in the intersection of the intervals defined by (H1) and (H2), as explained in Remark 6. The set \(\mathcal V_\sigma (V^-)\) may be defined in two different ways (cf. Fig. 11):
-
as the “upstream cells” to \(V^-\), i.e.
$$\begin{aligned} \mathcal V_\sigma (V^-) = \{ L\in {\mathcal M},\ L \text { shares a face }\sigma \text { with }V^- \text { and } F_{V^-,\sigma } \le 0 \}, \end{aligned}$$ -
when this makes sense (i.e. with a mesh obtained by \(Q_1\) mappings from the \((0,1)^d\) reference element), the opposite cells to \(\sigma \) in \(V^-\) are chosen. Note that for a structured mesh, this choice allows to recover the usual minmod limiter.
9 Appendix B: An Anti-diffusive Scheme
The scheme proposed in [5] by of B. Després and F. Lagoutière for the constant velocity advection problem presents some interesting properties in one space dimension (and may be extended to structured multi-dimensional meshes using alternate directions techniques); in particular, it notably limits the numerical diffusion. We extend here this scheme to work with unstructured meshes for which the “opposite cell to a face” (in the sense introduced in the previous section) may be defined and with a variable density. With the same notations as in the previous section, for \(\sigma \in {\mathcal E}_{\mathrm{int}}\), \(\sigma =K|L\) with \(F_{K,\sigma }^{n+1} \ge 0\),
-
the tentative value for \(y_\sigma \) is chosen as the downwind value, i.e. \(y_\sigma ^n=y_L^n\),
-
Then we project \(y_\sigma ^n\) on the interval
$$ I_\sigma = \bigl [ y_K^n,\,y_K^n+\frac{1-\nu }{\nu }(y_K-y_M) \bigr ],\quad \nu =\frac{|F_{K,\sigma }^{n+1}|\,\delta t}{\rho _K^{n+1}\ |K|}, $$where \(M\in {\mathcal M}\) is the control volume which stands at the opposite side of K with respect to L.
The original scheme presented in [5] is recovered by this formulation for the one-dimensional constant velocity convection equation. Note however, that if the space dimension is greater than one, the above limitation may be not sufficient to reserve the maximum principle.
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Grapsas, D., Herbin, R., Latché, JC., Nasseri, Y. (2021). A Staggered Pressure Correction Numerical Scheme to Compute a Travelling Reactive Interface in a Partially Premixed Mixture. In: Muñoz-Ruiz, M.L., Parés, C., Russo, G. (eds) Recent Advances in Numerical Methods for Hyperbolic PDE Systems. SEMA SIMAI Springer Series, vol 28. Springer, Cham. https://doi.org/10.1007/978-3-030-72850-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-72850-2_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72849-6
Online ISBN: 978-3-030-72850-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)