Please use this identifier to cite or link to this item: https://doi.org/10.1080/10407790600939767
Title: Improvement of SIMPLER algorithm for incompressible flow on collocated grid system
Authors: Cheng, Y.P.
Lee, T.S. 
Low, H.T.
Tao, W.Q.
Issue Date: May-2007
Source: Cheng, Y.P., Lee, T.S., Low, H.T., Tao, W.Q. (2007-05). Improvement of SIMPLER algorithm for incompressible flow on collocated grid system. Numerical Heat Transfer, Part B: Fundamentals 51 (5) : 463-486. ScholarBank@NUS Repository. https://doi.org/10.1080/10407790600939767
Abstract: In this article an Improved SIMPLER (CLEARER) algorithm is proposed to solve incompressible fluid flow and heat transfer problems. Numerical study shows with the CLEARER algorithm on a collocated grid, in the correction stage the velocities on the main nodes are overcorrected with the pressure correction, which lowers the convergence rate; hence a second relaxation factor is introduced to overcome this disadvantage. By setting this factor less than the underrelaxation factor for velocities, the convergence performance can be significantly enhanced; meanwhile, the robustness can also be increased. Four numerical examples with reliable solutions are computed to validate the CLEARER algorithm, and the results show that this algorithm can predict the numerical results accurately. Compared with the SIMPLER algorithm, CLEARER can enhance the convergence rate greatly, and in some cases it only needs as little as 17% of the iterations required by SIMPLER to reach the same convergence criterion.
Source Title: Numerical Heat Transfer, Part B: Fundamentals
URI: http://scholarbank.nus.edu.sg/handle/10635/73529
ISSN: 10407790
DOI: 10.1080/10407790600939767
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

18
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

17
checked on Nov 19, 2017

Page view(s)

29
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.