DNS 1-5 Computational Details: Difference between revisions
No edit summary |
|||
(22 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
=HiFi-TURB-DLR rounded step= | |||
{{ | {{DNSHeader | ||
|area=1 | |area=1 | ||
|number=5 | |number=5 | ||
Line 8: | Line 8: | ||
This section provides details of the computational approach used for the simulation of the present flow problem. Firstly, 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. | This section provides details of the computational approach used for the simulation of the present flow problem. Firstly, 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 == | == 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 [[ | 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 [[DNS_1-5_computational#1|Gottlieb ''et al.'' (1988)]] is mainly used. For the latter, the 2nd-scheme of Bassi and Rebay (BR2) is employed, see [[DNS_1-5_computational#2|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 [[ | 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 [[DNS_1-5_computational#3|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 [[DNS_1-5_computational#4|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 [[DNS_1-5_computational#5|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 [[ | For the present computation the fourth-order DG spatial discretization is combined with the fifth-order eight stages Rosenbrock-type scheme of [[DNS_1-5_computational#6|Di Marzo (1993)]]. | ||
== Spatial and temporal resolution, grids == | == Spatial and temporal resolution, grids == | ||
The computational domain extends in streamwise direction from <math>x/H = -12.7</math> to <math>x/H = 24.0</math> and has a spanwise width equal to <math>\Delta z/H=3</math>. Top boundary is located at normal coordinate <math>y/H=180</math>, where <math>y/H=0</math> is the normal coordinate of the solid wall downstream the rounded step. | |||
The grid is made of roughly 15 million elements with quadratic edges, resulting in more than 300 million Degrees of Freedom (DoF) per equation. | The grid is made of roughly 15 million elements with quadratic edges, resulting in more than 300 million Degrees of Freedom (DoF) per equation. | ||
[[ | [[DNS_1-5_computational#figure3|Fig. 3]] and [[DNS_1-5_computational#figure4|Fig. 4]] show details of the grid above the rounded step (lateral view) and the wall region (top view), respectively. | ||
In [[ | In [[DNS_1-5_computational#figure4|Fig. 4]] and [[DNS_1-5_computational#figure5|Fig. 5]] the coarse mesh region created downstream of the rounded step, i.e., for <math>x/H>13.82</math>, is clearly visible. The mesh coarsening is applied to reduce the solution gradients, thus mitigating spurious perturbations possibly originating at the outlet boundary. | ||
<div id="figure3"></div> | <div id="figure3"></div> | ||
Line 30: | Line 30: | ||
|[[Image:DNS1-5 rounded step grid wall resolution.png|500px]] | |[[Image:DNS1-5 rounded step grid wall resolution.png|500px]] | ||
|- | |- | ||
|align="center"|'''Figure 4:''' Detail of the computational grid above the wall region | |align="center"|'''Figure 4:''' Detail of the computational grid above the wall region downstream the rounded step (top view) | ||
|} | |||
<div id="figure5"></div> | |||
{|align="center" border="0" width="1100" | |||
|[[Image:DNS1-5 rounded step grid downstream coarsening.png|1100px]] | |||
|- | |||
|align="center"|'''Figure 5:''' Detail of the computational grid above the wall region (lateral view) | |||
|} | |} | ||
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 <math>\Delta t \approx 1/285 \,CTU</math>, | 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 <math>\Delta t \approx 1/285 \,CTU</math>, where <math>CTU</math> is the convective time unit defined with respect to the reference velocity and the step height. | ||
In [[ | In [[DNS_1-5_computational#table1|Tab. 1]] are reported the wall space and time resolution at the checkpoint (<math>x_{ckp}/H=-3.5</math>). Here, in order to account for the high-order nature of the numerical schemes employed, the wall resolution is obtained as | ||
<math>\Delta x^{+}={\dfrac{1}{\sqrt[3]{N_{DoF}}}\dfrac{\Delta x}{\delta_{\nu}}}, \qquad \Delta t^{+}={\dfrac{1}{q}\dfrac{\Delta t\, u_{\tau}}{\delta_{\nu}}}</math>, | <math>\Delta x^{+}={\dfrac{1}{\sqrt[3]{N_{DoF}}}\dfrac{\Delta x}{\delta_{\nu}}}, \qquad \Delta t^{+}={\dfrac{1}{q}\dfrac{\Delta t\, u_{\tau}}{\delta_{\nu}}}</math>, | ||
where <math>N_{DoF}</math> is the number of Degrees of Freedom per equation and <math>q</math> the time integration order (here <math>N_{DoF}=20</math> and <math>q=5</math>). | |||
The flow has been simulated for <math>40 \, CTU</math> with a DG polynomial approximation of degree 1. After that, the polynomial degree has been increased to 3 and the simulation has been continued for <math>50\, CTU </math> before gathering statistics for | The flow has been simulated for <math>40 \, CTU</math> with a DG polynomial approximation of degree 1. After that, the polynomial degree has been increased to 3 and the simulation has been continued for <math>50\, CTU </math> before gathering statistics for additional <math>75\, CTU</math>. | ||
<div id="table1"></div> | <div id="table1"></div> | ||
Line 47: | Line 54: | ||
|align="center"|'''<math>{\Delta x^{+}}</math>'''||align="center"|'''<math>{\Delta y_{1}^{+}}</math>||align="center"|'''<math>{\Delta z^{+}}</math>||align="center"|'''<math>{\Delta t^{+}}</math>''' | |align="center"|'''<math>{\Delta x^{+}}</math>'''||align="center"|'''<math>{\Delta y_{1}^{+}}</math>||align="center"|'''<math>{\Delta z^{+}}</math>||align="center"|'''<math>{\Delta t^{+}}</math>''' | ||
|- | |- | ||
|align="center"|'''<math>{ | |align="center"|'''<math>{17.8}</math>'''||align="center"|'''<math>{1.30}</math>'''||align="center"|'''<math>{18.6}</math>'''||align="center"|'''<math>{0.10}</math>''' | ||
|} | |} | ||
<center>'''Table 1:''' Near-wall space and time resolution at the checkpoint (<math>x_{ckp}/H=-3.5</math>)</center> | <center>'''Table 1:''' Near-wall space and time resolution at the checkpoint (<math>x_{ckp}/H=-3.5</math>)</center> | ||
== Computation of statistical quantities == | == Computation of statistical quantities == | ||
Within code MIGALE turbulence statistics are collected | Within code MIGALE turbulence statistics are collected on the run (see Appendix B of the [https://kbwiki-images.s3.amazonaws.com/8/80/List_of_desirable_and_minimum_quantities_to_be_entered_into_the_KB_Wiki.pdf 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 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 <math>k+1</math> to be able to properly represent a <math>k</math>-degree polynomial function. This choice results in <math>(k+1)^3</math> points for each element. | The number of points on each edge is set to <math>k+1</math> to be able to properly represent a <math>k</math>-degree polynomial function. This choice results in <math>(k+1)^3</math> points for each element. | ||
The | The statistics collected during the production run are those of the list of baseline quantities for compressible codes reported in Tab. 4 of the [https://kbwiki-images.s3.amazonaws.com/8/80/List_of_desirable_and_minimum_quantities_to_be_entered_into_the_KB_Wiki.pdf list of desirable quantities (PDF)]. | ||
Starting from this list, the set of statistics reported in Tab.1 of | 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 <math>k+1</math> over the set of points. | ||
==References== | ==References== | ||
Line 67: | Line 74: | ||
#<div id="5">'''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)</div> | #<div id="5">'''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)</div> | ||
#<div id="6">'''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)</div> | #<div id="6">'''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)</div> | ||
<br/> | <br/> | ||
Line 75: | Line 81: | ||
|organisation=Università degli studi di Bergamo (UniBG) | |organisation=Università degli studi di Bergamo (UniBG) | ||
}} | }} | ||
{{ | {{DNSHeader | ||
|area=1 | |area=1 | ||
|number=5 | |number=5 |
Latest revision as of 16:12, 17 February 2023
HiFi-TURB-DLR rounded step
Computational Details
This section provides details of the computational approach used for the simulation of the present flow problem. Firstly, 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 domain extends in streamwise direction from to and has a spanwise width equal to . Top boundary is located at normal coordinate , where is the normal coordinate of the solid wall downstream the rounded step. The grid is made of roughly 15 million elements with quadratic edges, resulting in more than 300 million Degrees of Freedom (DoF) per equation. Fig. 3 and Fig. 4 show details of the grid above the rounded step (lateral view) and the wall region (top view), respectively. In Fig. 4 and Fig. 5 the coarse mesh region created downstream of the rounded step, i.e., for , is clearly visible. The mesh coarsening is applied to reduce the solution gradients, thus mitigating spurious perturbations possibly originating at the outlet boundary.
![]() |
Figure 3: Detail of the computational grid above the rounded step (lateral view) |
![]() |
Figure 4: Detail of the computational grid above the wall region downstream the rounded step (top view) |
![]() |
Figure 5: Detail of the computational grid above the wall region (lateral view) |
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 step height. In Tab. 1 are reported the wall space and time resolution at the checkpoint (). Here, in order to account for the high-order nature of the numerical schemes employed, the 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 3 and the simulation has been continued for before gathering statistics for additional .
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
- 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)
- 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)
- 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)
- https://petsc.org/release/ PETSc Web page
- 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)
- 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: Francesco Bassi, Alessandro Colombo, Francesco Carlo Massa — Università degli studi di Bergamo (UniBG)
© copyright ERCOFTAC 2024