A Generalized Expression of Discretization Schemes
From Thermal-FluidsPedia
Computational methodologies for forced convection |
The above discretization schemes can be expressed in a single generalized form. The total flux J at the interface between two grid points that were defined in eq. (4.230) can be used to define:
|
which relates to the values of at grid points i and i+1 (see Fig. 4.19). The first term on the right side of eq. (4.243) will be related to some weighted average of
and
, and the second term will be related to the difference between
and
. Thus, one can express
J * the total flux as (Patankar, 1980)
|
where A and B are dimensionless coefficients that are functions of the grid Peclet number. If the field of is uniform, we will have
and eq. (4.243) becomes
|
Comparing eqs. (4.244) and (4.245) yields
|
For the grid system shown in Fig. 1, if we reconsider the problem in a reversed coordinate system x' (x' = − x), the grid Peclet number will become − PeΔ and J * becomes
|
The symmetric properties of A and B can be obtained by comparing eqs. (4.244) and (4.247), i.e.,
|
|
For the exponential schemes discussed above, one can obtain J * from eq(4.234)or (4.235), i.e.,
Comparing the above expression with eq. (4.244), one obtains
It can be verified that the above A and B satisfy eqs. (4.246), and (4.248) – (4.249). The implication of the above properties of A and B is that if the function A(PeΔ) for the case that PeΔ > 0 is known, the expressions of A and B for all PeΔ can be obtained. For example, if PeΔ < 0, eq. (4.246) can be used to obtain
A(PeΔ) = B(PeΔ) − PeΔ
Substituting eq. (4.248) into the above equation yields
A(PeΔ) = A( − PeΔ) − PeΔ
Considering for the case that PeΔ < 0, the above expression can be rewritten as
Since the following expression for A under any grid Peclet number can be expressed as
|
Similarly, the expression of B for any grid Peclet number can be expressed as (see Problem 4.24).
|
Therefore, different discretization schemes for the convection-diffusion terms can be characterized by different
.
To derive the generalized formula for different discretization schemes, let us begin from eq. (4.232), i.e.,
|
The total fluxes at the faces of the control volumes can be obtained from eq. (4.244), i.e.,
|
|
Substituting the above expressions into eq. (4.252) and rearranging the resulting equation yields
which can be rearranged as
|
where
|
|
aP = aE + aW + (Fe − Fw) |
In arriving at eqs. (4.256) and (4.257), A and B were obtained from eqs. (4.250) and (4.251). At this point, it is apparent that different discretization schemes can be characterized by different expressions for A(|PeΔ|). By comparing eqs. (4.256) and (4.257) with different expressions of aE and aW for different schemes, the corresponding A(|PeΔ|) for different schemes can be summarized in Table 1 and plotted in Fig. 2. It should be noted that the difference between the power law and exponential scheme is exaggerated for clear presentation. The generalized formula represented by eqs. (4.255) – (4.258) will be very helpful to develop a generalized computer code for all schemes. A special module or subroutine can be written for different schemes.
Table 1 Summary of A(|PeΔ|) for different schemes
Scheme | A(|PeΔ|) |
Central difference | ![]() |
Upwind | 1 |
Hybrid | ![]() |
Exponential | ![]() |
Power Law | ![]() |