Large-eddy simulation is rapidly becoming the preferred method for calculations involving turbulent phenomena. However, filtering equations as performed in traditional LES procedures leads to significant problems. In this work we present some key components in the construction of a novel LES solver for compressible turbulent flow, designed to overcome most of the problems faced by traditional LES procedures. We describe the construction of the large-scale algorithm, which employs fairly standard numerical techniques to solve the Navier{Stokes equations. We validate the algorithm for both transonic and supersonic ow scenarios. We further explicitly show that the solver is capable of capturing boundary layer effects. We present a detailed derivation of the chaotic map termed the \compressible poor man's Navier{Stokes (CPMNS) equation" starting from the Navier{Stokes equations themselves via a Galerkin procedure, which we propose to use as the fluctuating component in the SGS model. We provide computational results to show that the chaotic map can produce a wide range of temporal behaviors when the bifurcation parameters are varied over their ranges of stable behaviors. Investigations of the overall dynamics of the CPMNS equation demonstrates that its use increases the potential realism of the corresponding SGS model.
| Identifer | oai:union.ndltd.org:uky.edu/oai:uknowledge.uky.edu:gradschool_theses-1365 |
| Date | 01 January 2006 |
| Creators | Velkur, Chetan Babu |
| Publisher | UKnowledge |
| Source Sets | University of Kentucky |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | University of Kentucky Master's Theses |
Page generated in 0.002 seconds