A MULTIGRID COMPUTATION OF INCOMPRESSIBLE FLOW IN COMPLEX GEOMETRIES

A procedure using a Full Approximate Scheme (FAS) multigrid is developed in SIMPLEC algorithm with a layout of staggered grid in generalized curvilinear coordinates.This method is applied to three flow problems as test tasks.The comparison between the iteration performance of the Multi-Grid (MG) and Single-Grid (SG) methods in different grid sizes,Reynolds number and geometries demonstrates that the multigrid method improves convergence rate,reduces CPU time,and overcomes the deficiency of single-grid SIMPLEC algorithm in generalized curvilinear coordinates.