z-logo
Premium
Improved averaging method for turbulent flow simulation. Part II: Calculations and verification
Author(s) -
Dakhoul Youssef M.,
Bedford Keith W.
Publication year - 1986
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.1650060203
Subject(s) - turbulence , scalar (mathematics) , momentum (technical analysis) , grid , flow (mathematics) , mathematics , computational fluid dynamics , filter (signal processing) , finite difference , scalar field , finite difference method , statistical physics , mathematical analysis , classical mechanics , mechanics , physics , computer science , geometry , finance , economics , computer vision
This is the second of two articles intended to develop, apply and verify a new method for averaging the momentum and mass transport equations for turbulence. Part I presented the theoretical development of a new space‐time filter (STF) averaging procedure. The new method, as well as all existing averaging procedures, are applied to the one‐dimensional transient equations of momentum and scalar transport in a Burgers' flow field. Dense‐grid ‘exact’ results from the unaveraged equations are presented to depict the dynamic behaviour of the flow field and serve as a basis for verifying the coarse‐grid STF predictions. In this paper, a finite difference procedure is used to numerically solve the new STF averaged equations, as well as the other forms of the averaged equations derived in Part I. All averaged equations are solved on the same coarse grid. The velocity and scalar fields, predicted from each equation form, are intercompared according to a verification procedure based on the statistical and spectral properties of the results. It is found that the new STF procedure improves coarse‐grid dynamic predictions over the existing methods of averaging.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here