Please use this identifier to cite or link to this item:
|Title:||An efficient and robust numerical scheme for the SIMPLER algorithm on non-orthogonal curvilinear coordinates: CLEARER||Authors:||Cheng, Y.P.
|Issue Date:||May-2007||Citation:||Cheng, Y.P., Lee, T.S., Low, H.T., Tao, W.Q. (2007-05). An efficient and robust numerical scheme for the SIMPLER algorithm on non-orthogonal curvilinear coordinates: CLEARER. Numerical Heat Transfer, Part B: Fundamentals 51 (5) : 433-461. ScholarBank@NUS Repository. https://doi.org/10.1080/10407790601009115||Abstract:||In this article, an Improved SIMPLER (CLEARER) algorithm is formulated to solve the incompressible fluid flow and heat transfer on the nonstaggered, nonorthogonal curvilinear grid system. By virtue of a modified momentum interpolation method in calculating the interface contravariant velocity in both the predictor step and the corrector step, the coupling between pressure and velocity is fully guaranteed, and the conservation law is also satisfied. A second relaxation factor is introduced in the corrector step, of which the convergent solution is independent. By setting the second relaxation factor less than the underrelaxation factor for the velocity to some extent, both the convergence rate and robustness can be greatly enhanced. Meanwhile, the CLEARER algorithm can also overcome the severe grid nonorthogonality. With the simplified pressure-correction equation, the convergent solution can still be obtained even when the intersection angle among grid lines is as low as 1, which may provide valuable guidance in studying the fluid flow in complex geometries.||Source Title:||Numerical Heat Transfer, Part B: Fundamentals||URI:||http://scholarbank.nus.edu.sg/handle/10635/73157||ISSN:||10407790||DOI:||10.1080/10407790601009115|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 23, 2019
WEB OF SCIENCETM
checked on Aug 15, 2019
checked on Aug 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.