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]
^Mangani, L.; Bianchini, C. (2007). Heat transfer applications in turbomachinery(PDF). Proceedings of the OpenFOAM International Conference 2007. Retrieved 2016-03-16.
^Patankar, S. V. (1980). Numerical Heat Transfer and Fluid Flow. Taylor & Francis. ISBN 978-0-89116-522-4.
^Ferziger, J. H.; Peric, M. (2001). Computational Methods for Fluid Dynamics. Springer-Verlag. ISBN 978-3-540-42074-3.
^Tannehill, J. C.; Anderson, D. A.; Pletcher, R. H. (1997). Computational Fluid Mechanics and Heat Transfer. Taylor & Francis. ISBN 9781560320463.
fluid dynamics (CFD), the SIMPLEalgorithm is a widely used numerical procedure to solve the Navier–Stokes equations. SIMPLE is an acronym for Semi-Implicit...
algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, named after its creator, IBM scientist Hans Peter Luhn, is a simple check...
(Semi-Implicit Method for Pressure Linked Equations-Consistent) algorithm; a modified form of SIMPLEalgorithm; is a commonly used numerical procedure in the field...
In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ) is a finite sequence of mathematically rigorous instructions, typically used to solve...
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the input list element by element, comparing...
of solving it efficiently despite its simple, familiar statement. Among the authors of early sorting algorithms around 1951 was Betty Holberton, who worked...
distribution. Several efficient algorithms for simple random sampling have been developed. A naive algorithm is the draw-by-draw algorithm where at each step we...
Maze generation algorithms are automated methods for the creation of mazes. A maze can be generated by starting with a predetermined arrangement of cells...
Reservoir sampling is a family of randomized algorithms for choosing a simple random sample, without replacement, of k items from a population of unknown...
time steps and a lesser computing effort. It is an extension of the SIMPLEalgorithm used in computational fluid dynamics to solve the Navier-Stokes equations...
convex hull algorithm"). A much simpleralgorithm was developed by Chan in 1996, and is called Chan's algorithm. Known convex hull algorithms are listed...
is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors. Given an...
remedy SiMPLE, a computer programming development system SIMPLE, a 4GL environment for the Prime Computer, when running INFORMATION SIMPLEalgorithm, in...
the division are used). In this algorithm, if the M parameter is a power of 2, it becomes equivalent to the simpler Rice encoding: Fix the parameter...
even–odd rule algorithm, and was known as early as 1962. The algorithm is based on a simple observation that if a point moves along a ray from infinity...
point in the intersection of two closed convex sets. It is a very simplealgorithm and has been rediscovered many times. The simplest case, when the sets...
be computed in linear time, faster than algorithms for convex hulls of point sets. The convex hull of a simple polygon can be subdivided into the given...
different visiting orders, so they don't stay in the same area). Very simplealgorithm - easy to make bug-free. Uses a lot of memory, particularly when using...
genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA)....
The term "auction algorithm" applies to several variations of a combinatorial optimization algorithm which solves assignment problems, and network optimization...
The Kabsch algorithm, also known as the Kabsch-Umeyama algorithm, named after Wolfgang Kabsch and Shinji Umeyama, is a method for calculating the optimal...
calls on a telephone network during periods of high load. In a simple version of the algorithm, messages are delayed by predetermined (non-random) time. For...
Global Information