A rapidly convergent algorithm for the solution of Navier-Stokes equations

Krizmanić, Severino and Virag, Zdravko and Šavar, Mario (2014) A rapidly convergent algorithm for the solution of Navier-Stokes equations. = A rapidly convergent algorithm for the solution of Navier-Stokes equations. In: 11th. World Congress on Computational Mechanics - WCCM XI 5th. European Congress on Computational Mechanics - ECCM V 6th European Congress on Computational Fluid Dynamics - ECFD VI, 20-25.07.2014., Barcelona; Spain.

Full text not available from this repository.
Official URL: http://bib.irb.hr/prikazi-rad?rad=714847


In this paper a novel pressure-velocity coupling algorithm for the solution of the Navier-Stokes equations by finite volume method on collocated grids is presented. In order to achieve pressure-velocity coupling, SIMPLE-like methods generally combine an approximate divergence of the pressure gradient field obtained from the momentum equations and the continuity equation. In formulations on collocated grids, the working variables are cell velocity components and cell pressure, while in order to suppress checker-board solutions, the cell face mass fluxes used in continuity equation are obtained by using special interpolations. The convergence rate of SIMPLE-like methods strongly rely on under-relaxation factor values, especially in segregated algorithm formulations. Compared to SIMPLE-like methods, novel pressure-velocity coupling method presented in this paper has several fundamental differences. Novel method uses cell face mass fluxes as working variables and irrotationality condition for the pressure gradient, while the cell velocity components are obtained by using the continuity equation. The resulting new pressure-velocity coupling algorithm approaches the final solution in an segregated iterative procedure by correcting cell face mass fluxes until the pressure gradient field becomes irrotational. The mass fluxes corrections applied in the new algorithm preserve the solution of the continuity equation, so that continuity equation has to be solved only once, at the beginning of the iteration procedure. Due the presented properties, the new algorithm "naturally" bypasses the checker-board problem in the collocated variable arrangement and doesn't require a stabilization procedure in the iterative solution process. The new pressure-velocity coupling algorithm was coded into own computer program and compared with the SIMPLE algorithm implemented within a commercial software package. The conducted tests covered 2D and 3D incompressible, inviscid and laminar flow problems having various boundary conditions and grid sizes and steady free convection problems solved using Boussinesq approximation. In conducted tests, the convergence rate of the new algorithm showed to be independent on grid size. In strict comparisons performed, both algorithms used same differencing scheme and identical grids. The new pressure-velocity algorithm shows a significantly higher convergence rate and CPU time efficiency.

Item Type: Conference or Workshop Item (Lecture)
Keywords (Croatian): Algorithms; Cells; Computational fluid dynamics; Computational mechanics; Cytology; Finite volume method; Fluid dynamics; Incompressible flow; Iterative methods; Laminar flow; Natural convection; Pressure; Pressure gradient; Velocity; Viscous flow; Boussinesq approximations; Iterative solution process; Method of loops; Pressure-velocity coupling; Segregated methods; Under-relaxation factors; Unstructured grid; Various boundary conditions; Navier Stokes equations
Subjects: TECHNICAL SCIENCE > Mechanical Engineering
Divisions: 1400 Department of fluid mechanics > 1410 Chair of computer fluid mechanics
Indexed in Web of Science: No
Indexed in Current Contents: No
Citations SCOPUS: 0 (04.09.2017.)
Date Deposited: 28 May 2015 11:13
Last Modified: 04 Sep 2017 13:19
URI: http://repozitorij.fsb.hr/id/eprint/4250

Actions (login required)

View Item View Item

Nema podataka za dohvacanje citata