Professional Documents
Culture Documents
6.3.2 Y-Momentum Equation
6.3.2 Y-Momentum Equation
Using the control volume shown in Fig. 6.4, the y momentum equation can be
integrated over v-control volume as
ZZ
∆x∆y n+1 n ∂ 1 ∂v ∂ 1 ∂v
v2 −
vi,j − vi,j + uv − + dxdy
∆t ∂x Re ∂x ∂y Re ∂y
ZZ
∂p
+ dxdy = 0
∂y
∆x∆y n+1 n 2 2 2 2
(vi,j − vi,j ) + (Ei+1/2,j − Ei−1/2,j )∆y + (Fi,j+1/2 − Fi,j−1/2 )∆x
∆t
+(pn+1 n+1
i,j+1 − pi,j )∆x = 0 (6.8)
1 ∂v 1 ∂v
E 2 = uv − , F 2 = v2 −
Re ∂x Re ∂y
6.8 Computational Fluid Dynamics
2 1 (vi+1,j − vi,j )
Ei+1/2,j = 0.25(ui,j + ui,j+1 )(vi,j + vi+1,j ) −
Re ∆x
2 1 (vi,j − vi−1,j )
Ei−1/2,j = 0.25(ui−1,j + ui−1,j+1 )(vi−1,j + vi,j ) −
Re ∆x
2 1 (vi,j+1 − vi,j )
Fi,j+1/2 = 0.25(vi,j + vi,j+1 )2 −
Re ∆y
2 1 (vi,j − vi,j−1 )
Fi,j−1/2 = 0.25(vi,j−1 + vi,j )2 −
Re ∆y
The linearized form of these equations are
n+1 n+1
n+1 n+1 1 vi+1,j − vi,j
2
uni,j uni,j+1
Ei+ 1 = 0.25 + vi,j + vi+1,j −
2 ,j Re ∆x
n+1 n+1
1 vi,j − vi−1,j
n+1 n+1
2
uni−1,j uni−1,j+1
Ei− 1 = 0.25 + + − vi−1,j vi,j
2 ,j Re ∆x
n+1 n+1
2 n n
n+1 n+1
1 vi,j+1 − vi,j
Fi,j+ 1 = 0.25 vi,j + vi,j+1 vi,j + vi,j+1 −
2 Re ∆y
n+1 n+1
2 n n
n+1 n+1
1 vi,j − vi,j−1
Fi,j− 1 = 0.25 vi,j−1 + vi,j vi,j−1 + vi,j −
2 Re ∆y
Substituting E 2 and F 2 in Eq. (6.8) yields
∆x∆y n+1
X
n+1
+ avi,j vi,j avnb vnb + bv + ∆x pn+1 n+1
+ i,j+1 − pi,j =0 (6.9)
∆t
At any intermediate stage, the solution is to be advanced from nth time level
to (n + 1)th time level. The term bv equals −∆x∆yvi,j n
/∆t. The velocity is
advanced in two steps. First, the momentum equations (6.7) and (6.9) are
solved to obtain the provisional values of u∗ , and v ∗ . It is not possible to
obtain un+1 and v n+1 directly since the provisional velocities have not satisfied
the continuity equation as yet.To be noted that the nth level presssures are
available at this stage.
Making use of the approximate velocity solution u∗ , a pressure correction
δp will evolve which will give pn+1 = pn + δp and also a velocity correction
uc will be obtainable. As such, uc will correct u∗ in such a manner that
un+1 = u∗ + uc and un+1 will satisfy the continuity Eq. (6.5).
In order to obtain u∗ , Eqns. (6.7) and (6.9) are approximated as
∆x∆y u
X
aunb u∗nb = −bu − ∆y pni+1,j − pni,j
+ ai,j u∗i,j + (6.10)
∆t
Solution of Navier-Stokes.. 6.9
∆x∆y v
X
avnb vnb = −bv − ∆x pni,j+1 − pni,j
∗ ∗
+ ai,j vi,j + (6.11)
∆t
In order to make the link between uc and δp explicit, Eq. (6.12) can be reduced
to
E1 ∆y (δpi,j − δpi+1,j )
uci,j = (6.14)
(1 + E1 ) aui,j
where E1 = ∆t aui,j /∆x∆y
c
An equivalent expression can be obtained for vj,k as
c E2 ∆x (δpi,j − δpi,j+1 )
vi,j = (6.15)
(1 + E2 ) avi,j
api,j δpi,j =
X p
anb δpnb + bp (6.16)
6. Treat the corrected pressure pnew as new initial pressure pn . Use unew
i,j
new
and vi,j as uni,j and vi,j
n
. Calculate new u∗ from equations (6.10) and
(6.11). Repeat (2-5), the entire procedure until a converged solution is
obtained. It may be noted that the solution converges as bp = 0.
Patankar (1980) introduced a revised algorithm, SIMPLER to improve the sit-
uation. The SIMPLER algorithm has the following steps.
1. A velocity field û is computed from equations (6.10) and (6.11) with the
pressure terms deleted from the right-hand sides.
2. equation (6.16) then becomes a Poisson equation for pn+1 rather than δp
with û replacing the u∗ terms in bp .
3. The pn+1 (obtained from step 2) replaces pn in equations (6.10) and (6.11),
which are solved for u∗ (as it was done in SIMPLE).
4. Equation (6.16) is solved for δp and it is used to provide un+1 = u∗ + uc
but no further adjustment is made to pn+1 .
Van Doormal and Raithby (1984) proposed SIMPLEC which is another modi-
fied version of SIMPLE algorithm and gives faster convergence.
10 ai,j ui,j = bi,j ui+1,j + ci,j ui−1,j + (di,j ūi,j+1 + ei,j ūi,j−1 + fi,j )
Here ū is the currently available value in storage and all the coefficients including
fi,j are known. for each j, we shall get a system of equations if we susbtitute
i = 2......L − 1. In other words, for each j, a tridiagonal matrix is available
which can be solved for all i row of points at that j. Once one complete row is
evaluated for any particular j, the next j will be taken up, and so on.
(b) Horizontal Sweep Forward may be written in pseudo FORTRAN code as
DO 20 I = 2, L - 1
DO 20 J = 2, M - 1
20 ai,j ui,j = di,j ui,j+1 + ei,j ui,j−1 + (bi,j ūi+1,j + ci,j ūi−1,j + fi,j )
Again ū is the currently available value in storage from previous calculations.
For each i, we get a system of equation if we substitute j = 2....M − 1. A
tridiagonal matrix is available for each i. Once one complete column of points
are evaluated for any particular i, the next i will be taken up and so on. The
vertical sweep upward and downward are repeated. Similarly the horizontal
sweep forward and rearward are also repeated until convergence is achieved.
For solving tridiagonal system, the tridiagonal matrix algorithm (TDMA) due
to Thomas (1949) is deployed. The above mentioned evaluation procedure is
known as line-by-line TDMA.