A comprehensive performance comparison for segregated algorithms of flow and heat transfer in complicated geometries
by Z.G. Wu, Z.G. Qu, Ya-Ling He, W.Q. Tao
Progress in Computational Fluid Dynamics, An International Journal (PCFD), Vol. 8, No. 5, 2008

Abstract: In this paper, a comprehensive performance comparison among CLEAR, SIMPLER and SIMPLEC algorithms at staggered grid system is performed for four incompressible fluid flow and heat transfer problems in complicated geometries. It is found that for most of the relaxation factor variation range CLEAR can appreciably enhance the convergence rate though it is slightly less robust than the other two algorithms. For the four problems tested, the ratio of iteration numbers of CLEAR over that of SIMPLER and SIMPLEC can reach as low as 0.18, 0.09 and the ratio of the CPU time as low as 0.23, 0.18, respectively.

Online publication date: Mon, 14-Jul-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the Progress in Computational Fluid Dynamics, An International Journal (PCFD):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com