One major drawback of the eddy viscosity subgrid‐scale stress models used in large‐eddy simulations is their inability to represent correctly with a single universal constant different turbulent fields in rotating or sheared flows, near solid walls, or in transitional regimes. In the present work a new eddy viscosity model is presented which alleviates many of these drawbacks. The model coefficient is computed dynamically as the calculation progresses rather than input a priori. The model is based on an algebraic identity between the subgrid‐scale stresses at two different filtered levels and the resolved turbulent stresses. The subgrid‐scale stresses obtained using the proposed model vanish in laminar flow and at a solid boundary, and have the correct asymptotic behavior in the near‐wall region of a turbulent boundary layer. The results of large‐eddy simulations of transitional and turbulent channel flow that use the proposed model are in good agreement with the direct simulation data.

A dynamic subgrid‐scale eddy viscosity model

We present an overview of the lattice Boltzmann method (LBM), a parallel and efficient algorithm for simulating single-phase and multiphase fluid flows and for incorporating additional physical complexities. The LBM is especially useful for modeling complicated boundary conditions and multiphase interfaces. Recent extensions of this method are described, including simulations of fluid turbulence, suspension flows, and reaction diffusion systems.

Lattice boltzmann method for fluid flows

Considerable confusion surrounds the longstanding question of what constitutes a vortex, especially in a turbulent flow. This question, frequently misunderstood as academic, has recently acquired particular significance since coherent structures (CS) in turbulent flows are now commonly regarded as vortices. An objective definition of a vortex should permit the use of vortex dynamics concepts to educe CS, to explain formation and evolutionary dynamics of CS, to explore the role of CS in turbulence phenomena, and to develop viable turbulence models and control strategies for turbulence phenomena. We propose a definition of a vortex in an incompressible flow in terms of the eigenvalues of the symmetric tensor ${\bm {\cal S}}^2 + {\bm \Omega}^2$ are respectively the symmetric and antisymmetric parts of the velocity gradient tensor ${\bm \Delta}{\bm u}$. This definition captures the pressure minimum in a plane perpendicular to the vortex axis at high Reynolds numbers, and also accurately defines vortex cores at low Reynolds numbers, unlike a pressure-minimum criterion. We compare our definition with prior schemes/definitions using exact and numerical solutions of the Euler and Navier–Stokes equations for a variety of laminar and turbulent flows. In contrast to definitions based on the positive second invariant of ${\bm \Delta}{\bm u}$ or the complex eigenvalues of ${\bm \Delta}{\bm u}$, our definition accurately identifies the vortex core in flows where the vortex geometry is intuitively clear.

https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0022112095000462

On the identification of a vortex

http://home.eps.hw.ac.uk/~ab226/tmp/implicit/lele_92.pdf

Compact finite difference schemes with spectral-like resolution

/pdf/turbulence-and-the-dynamics-of-coherent-structures-i-1o6o6m60fm.pdf

Turbulence and the dynamics of coherent structures. I. Coherent structures

Adjoint equations of differential equations have seen widespread applications in optimization, inverse problems, and uncertainty quantification. A major challenge in solving adjoint equations for time dependent systems has been the need to use the solution of the original system in the adjoint calculation and the associated memory requirement. In applications where storing the entire solution history is impractical, checkpointing methods have frequently been used. However, traditional checkpointing algorithms such as revolve require a priori knowledge of the number of time steps, making these methods incompatible with adaptive time stepping. We propose a dynamic checkpointing algorithm applicable when the number of time steps is a priori unknown. Our algorithm maintains a specified number of checkpoints on the fly as time integration proceeds for an arbitrary number of time steps. The resulting checkpoints at any snapshot during the time integration have the optimal repetition number. The efficiency of our algorithm is demonstrated both analytically and experimentally in solving adjoint equations. This algorithm also has significant advantage in automatic differentiation when the length of execution is variable.

Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation

The assumed beta distribution model for the subgrid-scale probability density function (PDF) of the mixture fraction in large eddy simulation of nonpremixed, turbulent combustion is tested, a priori, for a reacting jet having significant heat release (density ratio of 5). The assumed beta distribution is tested as a model for both the subgrid-scale PDF and the subgrid-scale Favre PDF of the mixture fraction. The beta model is successful in approximating both types of PDF but is slightly more accurate in approximating the normal (non-Favre) PDF. To estimate the subgrid-scale variance of mixture fraction, which is required by the beta model, both a scale similarity model and a dynamic model are used. Predictions using the dynamic model are found to be more accurate. The beta model is used to predict the filtered value of a function chosen to resemble the reaction rate. When no model is used, errors in the predicted value are of the same order as the actual value. The beta model is found to reduce this error by about a factor of two, providing a significant improvement.

An evaluation of the assumed beta probability density function subgrid-scale model for large eddy simulation of nonpremixed, turbulent combustion with heat release

Minimum-dissipation eddy-viscosity models are a class of sub-filter models for large-eddy simulation that give the minimum eddy dissipation required to dissipate the energy of sub-filter scales. A previously derived minimum-dissipation model is the QR model. This model is based on the invariants of the resolved rate-of-strain tensor and has many desirable properties. It appropriately switches off for laminar and transitional flows, has low computational complexity, and is consistent with the exact sub-filter tensor on isotropic grids. However, the QR model proposed in the literature gives insufficient eddy dissipation. It is demonstrated that this can be corrected by increasing the model constant. The corrected QR model gives good results in simulations of decaying grid turbulence on an isotropic grid. On anisotropic grids the QR model is not consistent with the exact sub-filter tensor and requires an approximation of the filter width. It is demonstrated that the results of the QR model on anisotropic grids are primarily determined by the used filter width approximation, and that no approximation gives satisfactory results in simulations of both a temporal mixing layer and turbulent channel flow. A new minimum-dissipation model for anisotropic grids is proposed. This anisotropic minimum-dissipation (AMD) model generalizes the desirable practical and theoretical properties of the QR model to anisotropic grids and does not require an approximation of the filter width. The AMD model is successfully applied in simulations of decaying grid turbulence on an isotropic grid and in simulations of a temporal mixing layer and turbulent channel flow on anisotropic grids.

/pdf/minimum-dissipation-models-for-large-eddy-simulation-hgsr9tys65.pdf

Minimum-dissipation models for large-eddy simulation

Acoustic analogy computations of vortex shedding noise were carried out in the context of a two-dimensional, low-Mach-number laminar flow past a NACA 0012 airfoil at chord Reynolds number of 10 4 . The incompressible Navier-Stokes equations were solved numerically to give an approximate description of the near-field flow dynamics and the acoustic source functions. The radiated far-field noise was computed based on Curle's extension to the Lighthill analogy. This study emphasizes an accurate evaluation of the Reynolds stress quadrupoles in the presence of an extensive wake. An effective method for separating the physical noise source from spurious boundary contributions caused by eddies crossing a permeable computational boundary is presented. The effect of retarded-time variations across the source region is also examined. Computational solutions confirm that the quadrupole noise is weak compared with the noise due to lift and drag dipoles when the freestream Mach number is small. The techniques developed in this study are equally applicable to flows in which the volume quadrupoles act as a prominent noise source.

Computation of quadrupole noise using acoustic analogy

Numerical data of polymer drag reduced flows is interpreted in terms of modification of near-wall coherent structures. The originality of the method is based on numerical experiments in which boundary conditions or the governing equations are modified in a controlled manner to isolate certain features of the interaction between polymers and turbulence. As a result, polymers are shown to reduce drag by damping near-wall vortices and sustain turbulence by injecting energy onto the streamwise velocity component in the very near-wall region.

Parviz Moin

Papers

Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation

An evaluation of the assumed beta probability density function subgrid-scale model for large eddy simulation of nonpremixed, turbulent combustion with heat release

Minimum-dissipation models for large-eddy simulation

Computation of quadrupole noise using acoustic analogy

New Answers on the Interaction Between Polymers and Vortices in Turbulent Flows