DNS 1-6 Computational Details: Difference between revisions

From KBwiki
Jump to navigation Jump to search
Line 40: Line 40:


<div id="figure6"></div>
<div id="figure6"></div>
{|align="center" border="0" width="1100"
{|align="center" border="0" width="900"
|align="center"|[[Image:DNS1-6 Wing-body junction mesh junction.png|900px]]
|align="center"|[[Image:DNS1-6 Wing-body junction mesh junction.png|900px]]
|-
|-

Revision as of 16:53, 25 February 2023


Front Page

Description

Computational Details

Quantification of Resolution

Statistical Data

Instantaneous Data

Storage Format

Computational Details

This section provides details of the computational approach used for the simulation of the present flow problem. First, the main numerical features of the code MIGALE are given. Then, information about the computational grid is provided. Finally, the statistical quantities and their computation are explained.

Computational approach

The CFD code MIGALE can solve both compressible and incompressible flow problems and implements different flow models ranging from the Euler to the RANS equations. The solver uses the Discontinuous Galerkin (DG) method for the spatial discretization of the governing equations, here the compressible Navier-Stokes equations. The discontinuous nature of the numerical solution requires introducing a special treatment of the inviscid interface flux and of the viscous flux. For the former it is common practice to use suitably defined numerical flux functions, which ensure conservation and account for wave propagation. To this purpose, in the compressible case, the exact Riemann solver of Gottlieb et al. (1988) is mainly used. For the latter, the 2nd-scheme of Bassi and Rebay (BR2) is employed, see Bassi et al. (1997). The devised method uses hierarchical and orthonormal polynomial basis functions defined in the physical (mesh) space and relies for the time integration on, primarily, high-order Rosenbrock linearly-implicit schemes, see Bassi et al. (2015). The Jacobian matrix of the spatial discretization is computed analytically and linear systems are solved using preconditioned GMRES methods from the PETSc library (Portable Extensible Toolkit for Scientific Computations). For production runs time integration is coupled with time-step adaptation strategies able to improve the robustness and the efficiency in terms of time-to-solution of simulations, see Noventa et al. (2020).

For the present computation the fourth-order DG spatial discretization is combined with the fifth-order eight stages Rosenbrock-type scheme of Di Marzo (1993).

Spatial and temporal resolution, grids

The computational grid is made of elements with quadratic edges, resulting in more than 1 billion Degrees of Freedom (DoF) per equation. Fig. 4 illustrates the surface mesh at the bottom boundary from the inlet (left) to the outlet (right). Clearly visible is the mesh coarsening used downstream of the wing to reduce the solution gradients, thus mitigating spurious perturbations possibly originating from the outlet boundary. The coarsening was applied in two steps: (i) both along the span and stream direction for (solid wall boundary condition) and (ii) only along the streamwise direction for (symmetry boundary condition). The surface mesh detail shown in Fig. 5 also reveals a mesh density reduction in the span direction towards the lateral boundaries for . This choice was intended to alleviate the large computational cost of the simulation by limiting the fine mesh region to the proximity of the wing. The surface mesh at the floor was stretched in the direction normal to the bottom boundary with a growth factor equal to , see Fig. 6.

DNS1-6 Wing-body junction mesh bottom.png
Figure 4: Surface mesh at the bottom boundary (top view)


DNS1-6 Wing-body junction mesh bottom zoom.png
Figure 5: Detail of Surface mesh at the bottom boundary (top view)


DNS1-6 Wing-body junction mesh junction.png
Figure 6: Detail of the computational grid close to the junction


For the temporal integration, a fifth order linearly implicit Rosenbrock scheme is applied with an adaptive time stepping technique. The resulting average time step is roughly , where is the convective time unit defined with respect to the reference velocity and the wing thickness . In Tab. 2 are reported the near-wall spatial and temporal resolution at the checkpoint (). Here, in order to account for the high-order nature of the numerical schemes employed, the near-wall resolution is obtained as

,

where is the number of Degrees of Freedom per equation and the time integration order (here and ).

The flow has been simulated for with a DG polynomial approximation of degree 1. After that, the polynomial degree has been increased to 2 for . Then, the simulation has been continued for with the target polynomial degree 3 before gathering statistics for additional .

Table 2: Near-wall space and time resolution at the checkpoint ()

Computation of statistical quantities

Within code MIGALE turbulence statistics are collected on the run (see Appendix B of the list of desirable quantities (PDF)) in a set of points within each mesh element. The points' location is the same as that of a nodal multi-dimensional Lagrangian basis obtained by the tensor product of a one-dimensional Lagrange basis built on a set of evenly spaced points at edges. The number of points on each edge is set to to be able to properly represent a -degree polynomial function. This choice results in points for each element.

The statistics collected during the production run are those of the list of baseline quantities for compressible codes reported in Tab. 4 of the list of desirable quantities (PDF). Starting from this list, the set of statistics reported in Tab.1 of the same document is computed in a single postprocessing step exploiting simple algebraic manipulations and spatial derivations. In particular, spatial derivatives are computed analytically within each mesh element starting from a least square approximation of degree over the set of points.

References

  1. Gottlieb, J. J. and Groth, C. P. T.: Assessment of Riemann solvers for unsteady one-dimensional inviscid flows of perfect gases. Journal of Computational Physics, Vol. 78 (1988)
  2. Bassi, F., Rebay, S., Mariotti, G., Pedinotti, S. and Savini, M.: A high-order accurate discontinuous finite element method for inviscid and viscous turbomachinery flows. in: R. Decuypere, G. Dibelius (Eds.), Proceedings of the 2nd European Conference on Turbomachinery Fluid Dynamics and Thermodynamics, Technologisch Instituut, Antwerpen, Belgium, (1997)
  3. Bassi, F., Botti, L., Colombo, A., Ghidoni, A. and Massa, F.: Linearly implicit Rosenbrock-type Runge-Kutta schemes applied to the Discontinuous Galerkin solution of compressible and incompressible unsteady flows. Computers & Fluids (2015)
  4. G. Noventa, G., Massa, F., Rebay, S., Bassi, F. and Ghidoni, A.: Robustness and efficiency of an implicit time-adaptive discontinuous Galerkin solver for unsteady flows. Computers & Fluids (2020)
  5. Di Marzo, G.: RODAS5(4) - Méthodes de Rosenbrock d'ordre 5(4) adaptées aux problèmes différentiels-algébriques. MSc Mathematics Thesis, Faculty of Science, University of Geneva, (1993)






Contributed by: Alessandro Colombo (UNIBG), Francesco Carlo Massa (UNIBG), Michael Leschziner (ICL/ERCOFTAC), Jean-Baptiste Chapelier (ONERA) — University of Bergamo (UNIBG), ICL (Imperial College London), ONERA

Front Page

Description

Computational Details

Quantification of Resolution

Statistical Data

Instantaneous Data

Storage Format


© copyright ERCOFTAC 2024