Show all publications

On code verification of RANS solvers

AuthorsEça, L., Klaij, C.M., Vaz, G., Hoekstra, M., Pereira, F.S.
Conference/JournalJournal of Computational Physics
Date1 apr. 2016
Volume310
Pages418-439
This article discusses Code Verification of Reynolds-Averaged Navier Stokes (RANS) solvers that rely on face based finite volume discretizations for volumes of arbitrary shape. The study includes test cases with known analytical solutions (generated with the method of manufactured solutions) corresponding to laminar and turbulent flow, with the latter using eddy-viscosity turbulence models. The procedure to perform Code Verification based on grid refinement studies is discussed and the requirements for its correct application are illustrated in a simple one-dimensional problem. It is shown that geometrically similar grids are recommended for proper Code Verification and so the data should not have scatter making the use of least square fits unnecessary. Results show that it may be advantageous to determine the extrapolated error to cell size/time step zero instead of assuming that it is zero, especially when it is hard to determine the asymptotic order of grid convergence. In the RANS examples, several of the features of the ReFRESCO solver are checked including the effects of the available turbulence models in the convergence properties of the code. It is shown that it is required to account for non-orthogonality effects in the discretization of the diffusion terms and that the turbulence quantities transport equations can deteriorate the order of grid convergence of mean flow quantities.

Contact

Contact person photo

Serge Toxopeus

Team leader CFD development / Senior Researcher

You will need an account to view this content

To view this content you will need a login account. If you already have an account you can sign in below. If you want an account then you can create one.

Tags
cfd developmentcfd/simulation/desk studiesresearch and developmentverification and validationresearchv&v method paper