THE PERFORMANCE OF GEOMETRICCONSERVATION-BASED ALGORITHMS FORINCOMPRESSIBLE MULTIFLUID FLOW

Abstract

This article deals with the implementation and testing of seven segregated pressure-based algorithms for the prediction of incompressible multifluid flow. These algorithms belong to the geometric conservation-based algorithm (GCBA) group, in which the pressure-correction equation is derived from the constraint on volume fractions (i.e., the sum of volume fractions equals 1). The pressure-correction schemes in these algorithms are based on SIMPLE, SIMPLEC, SIMPLEX, SIMPLEM, SIMPLEST, PISO, and PRIME. The performance and accuracy of these algorithms are assessed by solving eight one-dimensional two-phase flow problems and comparing results with published data. The effects of grid size on convergence characteristics are analyzed by solving each problem over different grid sizes. Results clearly demonstrate the capability of all GCBA algorithms to predict a wide range of multifluid flow situations. Based on the convergence history plots and CPU times obtained for the problems solved, the GCBA can be divided into two groups, with the one composed of SIMPLEST and PRIME being generally less efficient than the second group, to which the remaining algorithms belong.

The financial support provided by the University Research Board at the American University of Beirut is gratefully acknowledged.