ScholarLens Back to search
2007•International Journal of Modern Physics CRequires access

IMPROVEMENT OF SIMPLER ALGORITHM FOR INCOMPRESSIBLE FLOW ON STAGGERED GRID SYSTEM

T. S. Lee, Yongpan Cheng, H. T. Low

Open publisher page 0 citations

Abstract

In this paper, the updating of the intermediate velocity in the correction stage in SIMPLE-like algorithms on staggered grid is discussed in detail, based on the discussion CLEARER algorithm that is extended from the non-staggered grid to the staggered grid. The performance of SIMPLER and CLEARER algorithms are compared using two numerical examples with reliable solutions. The results show that CLEARER can predict the numerical results as accurately as SIMPLER, and it can also enhance the convergence rate greatly under low under-relaxation factors. In some cases CLEARER algorithm can only need 27% of iteration number required by SIMPLER to reach the same convergence criterion.

About this research paper

What this paper is about

In this paper, the updating of the intermediate velocity in the correction stage in SIMPLE-like algorithms on staggered grid is discussed in detail, based on the discussion CLEARER algorithm that is extended from the non-staggered grid to the staggered grid. The performance of SIMPLER and CLEARER algorithms are compared using two numerical examples with reliable solutions. The results show that CLEARER can predict the numerical results as accurately as SIMPLER, and it can also enhance the convergence rate greatly under low under-relaxation factors. In some cases CLEARER algorithm can only need 27% of iteration number required by SIMPLER to reach the same convergence criterion.

Why it matters

A significance statement is not available in the OpenAlex record.

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

In this paper, the updating of the intermediate velocity in the correction stage in SIMPLE-like algorithms on staggered grid is discussed in detail, based on the discussion CLEARER algorithm that is extended from the non-staggered grid to the staggered grid. The performance of SIMPLER and CLEARER algorithms are compared using two numerical examples with reliable solutions. The results show that CLEARER can predict the numerical results as accurately as SIMPLER, and it can also enhance the convergence rate greatly under low under-relaxation factors. In some cases CLEARER algorithm can only need 27% of iteration number required by SIMPLER to reach the same convergence criterion.

Key concepts: Grid, Convergence (economics), Algorithm, Computer science, Rate of convergence, Compressibility, Relaxation (psychology), Simple (philosophy)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
IMPROVEMENT OF SIMPLER ALGORITHM FOR INCOMPRESSIBLE FLOW ON STAGGERED GRID SYSTEM — Research Paper | ScholarLens