z-logo
Premium
A coding error elimination procedure for validating isotropic turbulent convection numerical calculations in axisymmetric flows with Eulerian and Lagrangian descriptions
Author(s) -
Blank David A.
Publication year - 1992
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.1650141205
Subject(s) - turbulence , eulerian path , discretization , laminar flow , isotropy , cartesian coordinate system , mathematics , rotational symmetry , computational fluid dynamics , numerical analysis , classical mechanics , computer science , mechanics , physics , lagrangian , mathematical analysis , geometry , quantum mechanics
A procedure which ensures the elimination of discretization and coding errors in the numerical solution of a set of governing equations describing internal turbulent convection flows is given and illustrated. The governing equations investigated in the validation analysis are of general form. The equations for the turbulence model (k‐8) assume the turbulence to be isotropic. In the analysis a portion of the solution region uses a Lagrangian description while a Eulerian description is used elsewhere. The work was originally motivated by the need to validate numerical calculations performed in the modelling of cornbusting fluid flow within symmetric piston engines. Thus the procedure is demonstrated for an axisymmetric formulation. The same methodology can be even more easily applied to Cartesian‐based problems using the guidelines given in this work. Details of the procedure are presented in a very practical format, making it possible to consider both simpler and more complex governing equation sets with little additional effort. Thus the implementation of this procedure by researchers to a variety of both turbulent and laminar internal flow problems should prove to be easy.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here