Performance Analyses of IDEAL Algorithm on Highly Skewed Grid System

Abstract

IDEAL is an efficient segregated algorithm for the fluid flow and heat transfer problems. This algorithm has now been extended to the 3D nonorthogonal curvilinear coordinates. Highly skewed grids in the nonorthogonal curvilinear coordinates can decrease the convergence rate and deteriorate the calculating stability. In this study, the feasibility of the IDEAL algorithm on highly skewed grid system is analyzed by investigating the lid-driven flow in the inclined cavity. It can be concluded that the IDEAL algorithm is more robust and more efficient than the traditional SIMPLER algorithm, especially for the highly skewed and fine grid system. For example, at = 5 ∘ and grid number = 70 × 70 × 70, the convergence rate of the IDEAL algorithm is 6.3 times faster than that of the SIMPLER algorithm, and the IDEAL algorithm can converge almost at any time step multiple.

An Explicit Pressure-Based Algorithm for Incompressible Flows

“…14 It has been further extended and shown to work well for use on a variety of other problems including unsteady two phase flow, flow on highly skewed grids, and three dimensional collocated solvers. [15][16][17] However, IDEAL and SIMPLER are both iterative time advancement schemes and require relaxation of the momentum equations to ensure convergence. These aspects mean the algorithms can be computationally intensive for unsteady problems.…”