📑 Table of Contents

In computational fluid dynamics (CFD), the SIMPLE algorithm is a widely used numerical procedure to solve the Navier–Stokes equations. SIMPLE is an acronym for Semi-Implicit Method for Pressure Linked Equations.

The SIMPLE algorithm was developed by Prof. Brian Spalding and his student Suhas Patankar at Imperial College London in the early 1970s. Since then it has been extensively used by many researchers to solve different kinds of fluid flow and heat transfer problems.[1]

Many popular books on computational fluid dynamics discuss the SIMPLE algorithm in detail.[2][3] A modified variant is the SIMPLER algorithm (SIMPLE Revised), that was introduced by Patankar in 1979.[4]

Algorithm

edit

The algorithm is iterative. The basic steps in the solution update are as follows:

  1. Set the boundary conditions.
  2. Compute the gradients of velocity and pressure.
  3. Solve the discretized momentum equation to compute the intermediate velocity field.
  4. Compute the uncorrected mass fluxes at faces.
  5. Solve the pressure correction equation to produce cell values of the pressure correction.
  6. Update the pressure field: where urf is the under-relaxation factor for pressure.
  7. Update the boundary pressure corrections .
  8. Correct the face mass fluxes:
  9. Correct the cell velocities:  ; where is the gradient of the pressure corrections, is the vector of central coefficients for the discretized linear system representing the velocity equation and Vol is the cell volume.
  10. Update density due to pressure changes.

See also

edit

References

edit
  1. ^ Mangani, L.; Bianchini, C. (2007). Heat transfer applications in turbomachinery (PDF). Proceedings of the OpenFOAM International Conference 2007. Retrieved 2016-03-16.
  2. ^ Patankar, S. V. (1980). Numerical Heat Transfer and Fluid Flow. Taylor & Francis. ISBN 978-0-89116-522-4.
  3. ^ Ferziger, J. H.; Peric, M. (2001). Computational Methods for Fluid Dynamics. Springer-Verlag. ISBN 978-3-540-42074-3.
  4. ^ Tannehill, J. C.; Anderson, D. A.; Pletcher, R. H. (1997). Computational Fluid Mechanics and Heat Transfer. Taylor & Francis. ISBN 9781560320463.

📚 Artikel Terkait di Wikipedia

Algorithm

In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ) is a finite sequence of mathematically rigorous instructions, typically used to solve

Reservoir sampling

Reservoir sampling is a family of randomized algorithms for choosing a simple random sample, without replacement, of k items from a population of unknown

Luhn algorithm

The Luhn algorithm or Luhn formula (creator: IBM scientist Hans Peter Luhn), also known as the "modulus 10" or "mod 10" algorithm, is a simple check digit

In-place algorithm

In computer science, an in-place algorithm is an algorithm that operates directly on the input data structure without requiring extra space proportional

PISO algorithm

time steps and a lesser computing effort. It is an extension of the SIMPLE algorithm used in computational fluid dynamics to solve the Navier-Stokes equations

Sorting algorithm

of solving it efficiently despite its simple, familiar statement. Among the authors of early sorting algorithms around 1951 was Betty Holberton, who worked

Galactic algorithm

A galactic algorithm is an algorithm with record-breaking theoretical (asymptotic) performance, but which is not used due to practical constraints. Typical

Convex hull algorithms

convex hull algorithm"). A much simpler algorithm was developed by Chan in 1996, and is called Chan's algorithm. Known convex hull algorithms are listed