2003Engineering ComputationsRequires access

A comparison study of the convergence characteristics and robustness for four variants of SIMPLE‐family at fine grids

Min Zeng, Wen‐Quan Tao

Open publisher page 23 citations

Abstract

A comparative study is performed to reveal the convergence characteristics and the robustness of four variants in the semi‐implicit method for pressure‐linked equations (SIMPLE)‐family: SIMPLE, SIMPLE revised (SIMPLER), SIMPLE consistent (SIMPLEC), and SIMPLE extrapolation (SIMPLEX). The focus is concentrated in the solution at fine grid system. Four typical fluid flow and heat transfer problems are taken as the numerical examples (lid‐driven cavity flow, flow in an axisymmetric sudden expansion, flow in an annulus with inner surface rotating and the natural convection in a square enclosure). It is found that an appropriate convergence condition should include both mass conservation and momentum conservation requirements. For the four problems computed, the SIMPLEX always requires the largest computational time, the SIMPLER comes the next, and the computational time of SIMPLE and SIMPLEC are the least. As far as the robustness is concerned, the SIMPLE algorithm is the worst, the SIMPLER comes the next and the robustness of SIMPLEX and SIMPLEC are superior to the others. The SIMPLEC algorithm is then recommended, especially for the computation at a fine grid system. Brief discussion is provided to further reveal the reasons which may account for the difference of the four algorithms.

About this research paper

What this paper is about

A comparative study is performed to reveal the convergence characteristics and the robustness of four variants in the semi‐implicit method for pressure‐linked equations (SIMPLE)‐family: SIMPLE, SIMPLE revised (SIMPLER), SIMPLE consistent (SIMPLEC), and SIMPLE extrapolation (SIMPLEX). The focus is concentrated in the solution at fine grid system. Four typical fluid flow and heat transfer problems are taken as the numerical examples (lid‐driven cavity flow, flow in an axisymmetric sudden expansion, flow in an annulus with inner surface rotating and the natural convection in a square enclosure). It is found that an appropriate convergence condition should include both mass conservation and momentum conservation requirements. For the four problems computed, the SIMPLEX always requires the largest computational time, the SIMPLER comes the next, and the computational time of SIMPLE and SIMPLEC are the least. As far as the robustness is concerned, the SIMPLE algorithm is the worst, the SIMPLER comes the next and the robustness of SIMPLEX and SIMPLEC are superior to the others. The SIMPLEC algorithm is then recommended, especially for the computation at a fine grid system. Brief discussion is provided to further reveal the reasons which may account for the difference of the four algorithms.

Why it matters

OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A comparative study is performed to reveal the convergence characteristics and the robustness of four variants in the semi‐implicit method for pressure‐linked equations (SIMPLE)‐family: SIMPLE, SIMPLE revised (SIMPLER), SIMPLE consistent (SIMPLEC), and SIMPLE extrapolation (SIMPLEX). The focus is concentrated in the solution at fine grid system. Four typical fluid flow and heat transfer problems are taken as the numerical examples (lid‐driven cavity flow, flow in an axisymmetric sudden expansion, flow in an annulus with inner surface rotating and the natural convection in a square enclosure). It is found that an appropriate convergence condition should include both mass conservation and momentum conservation requirements. For the four problems computed, the SIMPLEX always requires the largest computational time, the SIMPLER comes the next, and the computational time of SIMPLE and SIMPLEC are the least. As far as the robustness is concerned, the SIMPLE algorithm is the worst, the SIMPLER comes the next and the robustness of SIMPLEX and SIMPLEC are superior to the others. The SIMPLEC algorithm is then recommended, especially for the computation at a fine grid system. Brief discussion is provided to further reveal the reasons which may account for the difference of the four algorithms.

Key concepts: Robustness (evolution), Mathematics, Grid, SIMPLE algorithm, Mathematical optimization, Applied mathematics, Simple (philosophy), Conservation of mass

Related papers

Back to paper searchBrowse research topicsOriginal source
A comparison study of the convergence characteristics and robustness for four variants of SIMPLE‐family at fine grids — Research Paper | ScholarLens