Implicit large-eddy simulation applied to turbulent channel flow with periodic constrictions

The subgrid-scale (SGS) model in a large-eddy simulation (LES) operates on a range of scales which is marginally resolved by discretization schemes. Accordingly, the discretization scheme and the subgrid-scale model are linked. One can exploit this link by developing discretization methods from subgrid-scale models, or the converse. Approaches where SGS models and numerical discretizations are fully merged are called implicit LES (ILES). Recently, we have proposed a systematic framework for the design, analysis, and optimization of nonlinear discretization schemes for implicit LES. In this framework parameters inherent to the discretization scheme are determined in such a way that the numerical truncation error acts as a physically motivated SGS model. The resulting so-called adaptive local deconvolution method (ALDM) for implicit LES allows for reliable predictions of isotropic forced and decaying turbulence and of unbounded transitional flows for a wide range of Reynolds numbers. In the present paper, ALDM is evaluated for the separated flow through a channel with streamwise-periodic constrictions at two Reynolds numbers Re = 2,808 and Re = 10,595. We demonstrate that, although model parameters of ALDM have been determined for isotropic turbulence at infinite Reynolds number, it successfully predicts mean flow and turbulence statistics in the considered physically complex, anisotropic, and inhomogeneous flow regime. It is shown that the implicit model performs at least as well as an established explicit model.      

Assessment of the finite volume method applied to the v2 − f model

The objective of this paper is to assess the accuracy of low‐order finite volume (FV) methods applied to the v² ? f turbulence model of Durbin (Theoret. Comput. Fluid Dyn. 1991; 3 :1–13) in the near vicinity of solid walls. We are not (like many others) concerned with the stability of solvers ‐ the topic at hand is simply whether the mathematical properties of the v² ? f model can be captured by the given, widespread, numerical method. The v² ? f model is integrated all the way up to solid walls, where steep gradients in turbulence parameters are observed. The full resolution of wall gradients imposes quite high demands on the numerical schemes and it is not evident that common (second order) FV codes can fully cope with such demands. The v² ? f model is studied in a statistically one‐dimensional, fully developed channel flow where we compare FV schemes with a highly accurate spectral element reference implementation. For the FV method a higher‐order face interpolation scheme, using Lagrange interpolation polynomials up to arbitrary order, is described. It is concluded that a regular second‐order FV scheme cannot give an accurate representation of all model parameters, independent of mesh density. To match the spectral element solution an extended source treatment (we use three‐point Gauss–Lobatto quadrature), as well as a higher‐order discretization of diffusion is required. Furthermore, it is found that the location of the first internal node need to be well within y⁺=1. Copyright © 2009 John Wiley & Sons, Ltd.     

High‐resolution p‐adaptive DG simulations of flows with moving shocks

High‐order accurate DG discretization is employed for Reynolds‐averaged Navier–Stokes equations modeling of complex shock‐dominated, unsteady flow generated by gas issuing from a shock tube nozzle. The DG finite element discretization framework is used for both the flow field and turbulence transport. Turbulent flow in the near wall regions and the flow field is modeled by the Spalart–Allmaras one‐equation model. The effect of rotation on turbulence modeling for shock‐dominated supersonic flows is considered for accurate resolution of the large coherent and vortical structures that are of interest in high‐speed combustion and supersonic flows. Implicit time marching methodologies are used to enable large time steps by avoiding the severe time step limitations imposed by the higher order DG discretizations and the source terms. Sufficiently high mesh density is used to enable crisp capturing of discontinuities. A p ? type refinement procedure is employed to accurately represent the vortical structures generated during the development of the flow. The computed solutions showed qualitative agreement with experiments. Copyright © 2014 John Wiley & Sons, Ltd.     

Three-dimensional mesh embedding for the Navier–Stokes equations using upwind control volumes

A numerical model for the compressible Navier–Stokes equations using local mesh embedding is presented. The model solves for three-dimensional turbulent flow using an algebraic mixing length model of turbulence. The technique of control volume upwinding is used to produce a novel treatment, whereby the hanging nodes on the mesh interfaces are left with null control volumes. This yields an efficient discretization scheme which ensures second-order accuracy, flux conservation and stability at the mesh interfaces, whilst retaining a simple interpolative treatment for the hanging nodes. The discrete flow equations are solved using the semi-implicit pressure correction method. The accuracy of the embedded mesh solver is demonstrated by modelling the three-dimensional flow through a cascade of turbine vanes at design and off-design conditions. Mesh embedding gives a saving of 48% in the number of nodes. The embedded mesh solutions compare well with fine structured mesh solutions and experimental measurements. The capability of the embedded mesh solver to perform solution adaptive calculations is demonstrated using a two-dimensional mid-height section of the cascade at the off-design flow conditions.     

An efficient high order direct ALE ADER finite volume scheme with a posteriori limiting for hydrodynamics and magnetohydrodynamics

In this paper, we present a new family of direct arbitrary–Lagrangian–Eulerian (ALE) finite volume schemes for the solution of hyperbolic balance laws on unstructured meshes in multiple space dimensions. The scheme is designed to be high‐order accurate both in space and time, and the mesh motion, which provides the new mesh configuration at the next time step, is taken into account in the final finite volume scheme that is based directly on a space‐time conservation formulation of the governing PDE system. To improve the computational efficiency of the algorithm, high order of accuracy in space is achieved using the a posteriori MOOD limiting strategy that allows the reconstruction procedure to be carried out with only one reconstruction stencil for any order of accuracy. We rely on an element‐local space‐time Galerkin finite element predictor on moving curved meshes to obtain a high‐order accurate one‐step time discretization, while the mesh velocity is computed by means of a suitable nodal solver algorithm that might also be supplemented with a local rezoning procedure to improve the mesh quality. Next, the old mesh configuration at time level tⁿ is connected to the new one at t^n + 1 by straight edges, hence providing unstructured space‐time control volumes, on the boundary of which the numerical flux has to be integrated. Here, we adopt a quadrature‐free integration, in which the space‐time boundaries of the control volumes are split into simplex sub‐elements that yield constant space‐time normal vectors and Jacobian matrices. In this way, the integrals over the simplex sub‐elements can be evaluated once and for all analytically during a preprocessing step. We apply the new high‐order direct ALE algorithm to the Euler equations of compressible gas dynamics (also referred to as hydrodynamics equations) as well as to the magnetohydrodynamics equations and we solve a set of classical test problems in two and three space dimensions. Numerical convergence rates are provided up to fifth order of accuracy in 2D and 3D for both hyperbolic systems considered in this paper. Finally, the efficiency of the new method is measured and carefully compared against the original formulation of the algorithm that makes use of a WENO reconstruction technique and Gaussian quadrature formulae for the flux integration: depending on the test problem, the new class of very efficient direct ALE schemes proposed in this paper can run up to ≈12 times faster in the 3D case. Copyright © 2016 John Wiley & Sons, Ltd.     

Calculation of three‐dimensional turbulent flow with a finite volume multigrid method

A numerical method for the efficient calculation of three‐dimensional incompressible turbulent flow in curvilinear co‐ordinates is presented. The mathematical model consists of the Reynolds averaged Navier–Stokes equations and the k–ε turbulence model. The numerical method is based on the SIMPLE pressure‐correction algorithm with finite volume discretization in curvilinear co‐ordinates. To accelerate the convergence of the solution method a full approximation scheme‐full multigrid (FAS‐FMG) method is utilized. The solution of the k–ε transport equations is embedded in the multigrid iteration. The improved convergence characteristic of the multigrid method is demonstrated by means of several calculations of three‐dimensional flow cases. Copyright © 1999 John Wiley & Sons, Ltd.     

MULTIGRID CONVERGENCE ACCELERATION FOR TURBULENT SUPERSONIC FLOWS

A multigrid convergence acceleration technique has been developed for solving both the Navier–Stokes and turbulence transport equations. For turbulence closure a low-Reynolds-number q–ω turbulence model is employed. To enable convergence, the stiff non-linear turbulent source terms have to be treated in a special way. Further modifications to standard multigrid methods are necessary for the resolution of shock waves in supersonic flows. An implicit LU algorithm is used for numerical time integration. Several ramped duct test cases are presented to demonstrate the improvements in performance of the numerical scheme. Cases with strong shock waves and separation are included. It is shown to be very effective to treat fluid and turbulence equations with the multigrid method. A comparison with experimental data demonstrates the accuracy of the q–ω turbulence closure for the simulation of supersonic flows. © 1997 by John Wiley & Sons, Ltd. Int. j. numer. methods fluids 24: 1019–1035, 1997.     

A multiscale approach to hybrid RANS/LES wall modeling within a high-order discontinuous Galerkin scheme using function enrichment

We present a novel approach to hybrid Reynolds-averaged Navier-Stokes (RANS)/ large eddy simulation (LES) wall modeling based on function enrichment, which overcomes the common problem of the RANS-LES transition and enables coarse meshes near the boundary. While the concept of function enrichment as an efficient discretization technique for turbulent boundary layers has been proposed in an earlier article by Krank & Wall (A new approach to wall modeling in LES of incompressible flow via function enrichment. J Comput Phys. 2016;316:94-116), the contribution of this work is a rigorous derivation of a new multiscale turbulence modeling approach and a corresponding discontinuous Galerkin discretization scheme. In the near-wall area, the Navier-Stokes equations are explicitly solved for an LES and a RANS component in one single equation. This is done by providing the Galerkin method with an independent set of shape functions for each of these two methods; the standard high-order polynomial basis resolves turbulent eddies, where the mesh is sufficiently fine and the enrichment automatically computes the ensemble-averaged flow if the LES mesh is too coarse. As a result of the derivation, the RANS model is applied solely to the RANS degrees of freedom, which effectively prevents the typical issue of a log-layer mismatch in attached boundary layers. As the full Navier-Stokes equations are solved in the boundary layer, spatial refinement gradually yields wall-resolved LES with exact boundary conditions. Numerical tests show the outstanding characteristics of the wall model regarding grid independence, superiority compared to equilibrium wall models in separated flows, and achieve a speed-up by two orders of magnitude compared to wall-resolved LES.     

Mixed‐order interpolation for the Galerkin coarse‐grid approximations in algebraic multigrid solvers

An empirical investigation is made of AMG solver performance for the fully coupled set of Navier–Stokes equations. The investigation focuses on two different FV discretizations for the standard driven cavity test problem. One is a collocated vertex‐based discretization; the other is a cell‐centred staggered‐grid discretization. Both employ otherwise identical orthogonal Cartesian meshes. It is found that if mixed‐order interpolation is used in the construction of the Galerkin coarse‐grid approximation (CGA), a close‐to‐optimum mesh‐independent scaling of the AMG convergence is observed with similar convergence rates for both discretizations. If, on the other hand, an equal‐order interpolation is used, convergence rates are mesh‐dependent but the scaling differs in each case. For the collocated‐grid case, it depends both on the mesh size, h (or bandwidth Q～h^?1) and on the total number of grids, G, whereas for the staggered‐grid case it depends only on Q. Comparing the two characteristics reveals that the Q‐dependent parts are very similar; it is only in the G‐dependent convergence for the collocated‐grid case that they differ. This takes the form of stepped reductions in the AMG convergence rate (implying step reductions in the quality of the Galerkin CGA that correlate exactly with step increases in G). These findings reinforce previous evidence that, for optimum mesh‐independent performance, mixed‐order interpolations should be used in forming Galerkin CGAs for coupled Navier–Stokes problems. Copyright © 2010 John Wiley & Sons, Ltd.     

Numerical simulations of the steady Navier–Stokes equations using adaptive meshing schemes

In this paper, we consider an adaptive meshing scheme for solution of the steady incompressible Navier–Stokes equations by finite element discretization. The mesh refinement and optimization are performed based on an algorithm that combines the so‐called conforming centroidal Voronoi Delaunay triangulations (CfCVDTs) and residual‐type local a posteriori error estimators. Numerical experiments in the two‐dimensional space for various examples are presented with quadratic finite elements used for the velocity field and linear finite elements for the pressure. The results show that our meshing scheme can equally distribute the errors over all elements in some optimal way and keep the triangles very well shaped as well at all levels of refinement. In addition, the convergence rates achieved are close to the best obtainable. Extension of this approach to three‐dimensional cases is also discussed and the main challenge is the efficient implementation of three‐dimensional CfCVDT generation that is still under development. Copyright © 2007 John Wiley & Sons, Ltd.     

A robust and adaptive recovery‐based discontinuous Galerkin method for the numerical solution of convection–diffusion equations

In this paper, we introduce and test the enhanced stability recovery (ESR) scheme. It is a robust and compact approach to the computation of diffusive fluxes in the framework of discontinuous Galerkin methods. The scheme is characterized by a new recovery basis and a new procedure for the weak imposition of Dirichlet boundary conditions. These features make the method flexible and robust, even in the presence of highly distorted meshes. The implementation is simplified with respect to the original recovery scheme (RDG1x). Furthermore, thanks to the proposed approach, a robust implementation of p‐adaptive algorithms is possible. Numerical tests on unstructured grids show a convergence rate equal to p + 1, where p is the reconstruction order. Comparisons are shown with the original recovery scheme RDG1x and the widely used BR2 method. Results show a significantly larger stability region for the proposed discretization when explicit Runge–Kutta time integration is employed. Interestingly, this advantage grows quickly when the reconstruction order is increased. The proposed procedure for the weak imposition of Dirichlet boundary conditions does not need the introduction of ghost cells, and it is truly local because it does not require data exchange with other elements. It can be easily used with curvilinear wall elements. Several test cases are considered. They include some benchmark tests with the heat equation and compressible Navier–Stokes equations, with test cases designed also to evaluate the behaviour of the scheme with very stretched elements and separated flows. Copyright © 2014 John Wiley & Sons, Ltd.     

Finite element implementation of two‐equation and algebraic stress turbulence models for steady incompressible flows

The main purpose of this paper is to describe a finite element formulation for solving the equations for k and ε of the classical k–ε turbulence model, or any other two‐equation model. The finite element discretization is based on the SUPG method together with a discontinuity capturing technique to deal with sharp internal and boundary layers. The iterative strategy consists of several nested loops, the outermost being the linearization of the Navier–Stokes equations. The basic k–ε model is used for the implementation of an algebraic stress model that is able to account for the effects of rotation. Some numerical examples are presented in order to show the performance of the proposed scheme for simulating directly steady flows, without the need of reaching the steady state through a transient evolution. Copyright © 1999 John Wiley & Sons, Ltd.     

The direct simulation Monte Carlo method using unstructured adaptive mesh and its application

The implementation of an adaptive mesh‐embedding (h‐refinement) scheme using unstructured grid in two‐dimensional direct simulation Monte Carlo (DSMC) method is reported. In this technique, local isotropic refinement is used to introduce new mesh where the local cell Knudsen number is less than some preset value. This simple scheme, however, has several severe consequences affecting the performance of the DSMC method. Thus, we have applied a technique to remove the hanging node, by introducing the an‐isotropic refinement in the interfacial cells between refined and non‐refined cells. Not only does this remedy increase a negligible amount of work, but it also removes all the difficulties presented in the originals scheme. We have tested the proposed scheme for argon gas in a high‐speed driven cavity flow. The results show an improved flow resolution as compared with that of un‐adaptive mesh. Finally, we have used triangular adaptive mesh to compute a near‐continuum gas flow, a hypersonic flow over a cylinder. The results show fairly good agreement with previous studies. In summary, the proposed simple mesh adaptation is very useful in computing rarefied gas flows, which involve both complicated geometry and highly non‐uniform density variations throughout the flow field. Copyright © 2002 John Wiley & Sons, Ltd.     

A volume-agglomeration multirate time advancing for high Reynolds number flow simulation

A frequent configuration in computational fluid mechanics combines an explicit time advancing scheme for accuracy purposes and a computational grid with a very small portion of much smaller elements than in the remaining mesh. Two examples of such situations are the travel of a discontinuity followed by a moving mesh, and the large eddy simulation of high Reynolds number flows around bluff bodies where together very thin boundary layers and vortices of much more important size need to be captured. For such configurations, multistage explicit time advancing schemes with global time stepping are very accurate but very CPU consuming. In order to reduce this problem, the multirate (MR) time stepping approach represents an interesting improvement. The objective of such schemes, which allow to use different time steps in the computational domain, is to avoid penalizing the computational cost of the time advancement of unsteady solutions that would become large due to the use of small global time steps imposed by the smallest elements such as those constituting the boundary layers. In the present work, a new MR scheme based on control volume agglomeration is proposed for the solution of the compressible Navier-Stokes equations equipped with turbulence models. The method relies on a prediction step where large time steps are performed with an evaluation of the fluxes on macrocells for the smaller elements for stability purpose and a correction step in which small time steps are employed. The accuracy and efficiency of the proposed method are evaluated on several benchmarks flows: the problem of a moving contact discontinuity (inviscid flow), the computation with a hybrid turbulence model of flows around bluff bodies like a flow around a space probe model at Reynolds number 10⁶, a circular cylinder at Reynolds number 8.4 × 10⁶, and two tandem cylinders at Reynolds number 1.66 × 10⁵ and 1.4 × 10⁵.     

Shape Optimization for 3D Turbulent Flows Using Automatic Differentiation

Abstract

We present through this paper some new results with our approach for optimal shape design based on a CAD-free framework for shape and unstructured mesh deformations, automatic differentiation by program for the gradient computation and mesh adaption by metric control. Automatic differentiation allows for an easy, reliable and fast discrete adjoint computation. We managed to get the Jacobian of our Navier-Stokcs solver including a k-e turbulence model and wall-laws. The CAD-free framework is shown to be particularly convenient for optimization when the mesh connectivities and the shape discretization arc variable during optimization. Using these ingredients constrained optimization for turbulent transonic flows has been investigated in both 2 and 3D.     

A multigrid method with higher‐order discretization schemes

The implementation of the multigrid method into the SIMPLE algorithm presents interesting aspects concerning the mass fluxes conservation on coarser grids, the k–ε turbulence model and the higher‐order discretization schemes. Higher‐order discretization schemes for the convection terms are increasingly used in order to guarantee accuracy in demanding engineering applications. However, when used in single‐grid algorithms, their convergence is considerably slower compared with the first‐order schemes. Unbounded higher‐order schemes offer maximum accuracy, but quite often they do not converge due to their oscillatory behaviour. This paper demonstrates the dual function of the multigrid method: reduction of CPU time and stabilization of the iterating procedure, making it possible to perform computations with the third‐order accurate QUICK scheme in all cases. The method is applied to the calculation of two‐ and three‐dimensional flows with or without turbulence modelling. The results show that the convergence rate of the present algorithm does not deteriorate when QUICK is used and that, if applied on complex engineering cases, large gains in computational time can be achieved. Copyright © 2001 John Wiley & Sons, Ltd.     

Unified semi‐analytical wall boundary conditions for inviscid,laminar or turbulent flows in the meshless SPH method

Wall boundary conditions in smoothed particle hydrodynamics (SPH) is a key issue to perform accurate simulations. We propose here a new approach based on a renormalising factor for writing all boundary terms. This factor depends on the local shape of a wall and on the position of a particle relative to the wall, which is described by segments (in two‐dimensions), instead of the cumbersome fictitious or ghost particles used in most existing SPH models. By solving a dynamic equation for the renormalising factor, we significantly improve traditional wall treatment in SPH, for pressure forces, wall friction and turbulent conditions. The new model is demonstrated for cases including hydrostatic conditions for still water in a tank of complex geometry and a dam break over triangular bed profile with sharp angle where significant improved behaviour is obtained in comparison with the conventional boundary techniques. The latter case is also compared with a finite volume and volume‐of‐fluid scheme. The performance of the model for a two‐dimensional laminar flow in a channel is demonstrated where the profiles of velocity are in agreement with the theoretical ones, demonstrating that the derived wall shear stress balances the pressure gradient. Finally, the performance of the model is demonstrated for flow in a schematic fish pass where both the velocity field and turbulent viscosity fields are satisfactorily reproduced compared with mesh‐based codes. Copyright © 2012 John Wiley & Sons, Ltd.     

Finite element analysis of air flow around permeable sand fences

A numerical study of the turbulent air flow in a trench trap and the turbulent flow around a permeable sand fence is reported in this paper. The two-dimensional modified k–ε turbulence model proposed by Kato and Launder is used to predict the turbulent characteristics of the air flow. The discretization method for the governing equations is the three-step Taylor/Galerkin finite element method proposed by the authors. For the flow in a trench trap the numerical results are compared with experimental data obtained under realistic conditions using a large wind tunnel. For the air flow around a permeable sand fence a pressure loss model is used to represent the effect of the porosity of the fence on the flow field. © 1997 John Wiley & Sons, Ltd.     

On the finite-element calculation of turbulent flow using the k-ϵ model

Although the finite-element (FE) method has been successful in analysing complex laminar flows, a number of difficulties can arise when two-equation turbulence models (e.g. the k-? model) are incorporated. This work describes a particular FE discretization of the k-? model and reports its performance in recirculating flow. Severe problems encountered in attempts to obtain convergence of the numerical scheme are isolated and analysed, and methods by which the problems can be overcome are suggested. Insight gained in this work has enabled a practical turbulent flow FE code to be constructed which is robust and efficient. This code is the subject of a further paper.