SIMPLEC algorithm explained

The SIMPLEC (Semi-Implicit Method for Pressure Linked Equations-Consistent) algorithm; a modified form of SIMPLE algorithm; is a commonly used numerical procedure in the field of computational fluid dynamics to solve the Navier–Stokes equations.

This algorithm was developed by Van Doormal and Raithby in 1984. The algorithm follows the same steps as the SIMPLE algorithm, with the variation that the momentum equations are manipulated, allowing the SIMPLEC velocity correction equations to omit terms that are less significant than those omitted in SIMPLE. This modification attempts to minimize the effects of dropping velocity neighbor correction terms.[1]

Algorithm

The steps involved are same as the SIMPLE algorithm and the algorithm is iterative in nature. p*, u*, v* are guessed Pressure, X-direction velocity and Y-direction velocity respectively, p', u', v' are the correction terms respectively and p, u, v are the correct fields respectively; Φ is the property for which we are solving and d terms are involved with the under relaxation factor. So, steps are as follows:

1. Specify the boundary conditions and guess the initial values.

2. Determine the velocity and pressure gradients.

3. Calculate the pseudo velocities.

\hat{u}i,J=

\sumanb
*
u
nb
+bi,J
ai,J

\hat{v}I,j=

\sumanb
*
v
nb
+bI,j
aI,j

4. Solve for the pressure equation and get the p.

aI,JpI,J=aI-1,JpI-1,J+aI+1,JpI+1,J+aI,J-1pI,J-1+aI,J+1pI,J+1+bI,J

5. Set p*=p.

6. Using p* solve the discretized momentum equation and get u* and v*.

ai,J

*
u
i,J

=\sumanb

*
u
nb

+

*
(p
I-1,J

-

*
p
I,J

)Ai,J+bi,J

aI,j

*
v
I,j

=\sumanb

*
v
nb

+

*
(p
I,J-1

-

*
p
I,J

)AI,j+bI,j

7. Solve the pressure correction equation.

aI,Jp'I,J=aI-1,Jp'I-1,J+aI+1,Jp'I+1,J+aI,J-1p'I,J-1+aI,J+1p'I,J+1+b'I,J

8. Get the pressure correction term and evaluate the corrected velocities and get p, u, v, Φ*.

ui,J

*
=u
i,J

+di,J(p'I-1,J-p'I,J)

vI,j

*
=v
I,j

+ dI,j(p'I,J-1-p'I,J)

9. Solve all other discretized transport equations.

aI,J\phiI,J=aI-1,J\phiI-1,J+aI+1,J\phiI+1,J+aI,J-1\phiI,J-1+aI,J+1\phiI,J+1+

\phi
b
I,J

10. If Φ shows convergence, then STOP and if not, then set p*=p, u*=u, v*=v, Φ*=Φ and start the iteration again.
[2] [3]

Peculiar features

See also

Notes and References

  1. Web site: Variants of SIMPLE algorithm. engineering.purdue.edu. 11 November 2014.
  2. Book: Versteeg. H.K.. Malalasekera. W.. An introduction to Computational Fluid Dynamics- The finite volume method. Longman Group Ltd.. 149–151. 1st edition, 1995.
  3. Book: Patankar, S. V. . Suhas Patankar

    . Suhas Patankar . Numerical Heat Transfer and Fluid Flow . . 1980 . 978-0-89116-522-4.

  4. Web site: SIMPLE solver for driven cavity problem. engineering.purdue.edu.