2.29 Numerical Fluid Mechanics Lecture 25 Slides

2.29 Numerical Fluid Mechanics Lecture 25 Slides

2.29 Numerical Fluid Mechanics η NW N y n ne iη Spring 2015 – Lecture 25 n ξ nw iξ e E n P n n REVIEW Lecture 24: w W S se sw • Finite Volume on Complex geometries n SE j S – Computation of convective fluxes: i x xy • For mid-point rule:Fe (.) vn dS fSee ( vn .)eeeeeeeeee S m() S u S v Image by MIT OpenCourseWare. Se – Computation of diffusive fluxes: mid-pointpoint rule for complex geometries often used • Either use shape function (x, y), with mid-point rule: Fd ( k .) nS k Sx Sy e ee e ee xye e • Or compute derivatives at CV centers first, then interpolate to cell faces. Option include either: xi – Gauss Theorem: dV dV c Sc dV x xxiiP P CV i 4c faces old Fd kSEP kS ni – Deferred-correction approach: e ee eee rrEP old old – Comments on 3D where is interpolated from ,e.g. Sxi dV eP c c xi P 4c faces 2.29 Numerical Fluid Mechanics PFJL Lecture 25, 1 2.29 Numerical Fluid Mechanics Spring 2015 – Lecture 25 REVIEW Lecture 24, Cont’d: • Turbulent Flows and their Numerical Modeling η (Kolmogorov microscale) – Properties of Turbulent Flows LO/ ~ (Re3/4 ) • Stirring and Mixing L ReL UL • Energy Cascade and Scales Image by MIT OpenCourseWare. • Turbulent Wavenumber Spectrum and Scales S SK( ,) A2/3 K 5/3 L 1 1 K 1 – Numerical Methods for Turbulent Flows: Classification ε = turbulent energy dissipation • Direct Numerical Simulations (DNS) for Turbulent Flows • Reynolds-averaged Navier-Stokes (RANS) – Mean and fluctuations – Reynolds Stresses – Turbulence closures: Eddy viscosity and diffusivity, Mixing-length Models, k-ε Models – Reynolds-Stress Equation Models • Large-Eddy Simulations (LES) – Spatial filtering – LES subgrid-scale stresses 2.29 • Examples Numerical Fluid Mechanics PFJL Lecture 25, 2 References and Reading Assignments • Chapter 9 on “Turbulent Flows” of “J. H. Ferziger and M. Peric, Computational Methods for Fluid Dynamics. Springer, NY, 3rd ed., 2002” • Chapter 3 on “Turbulence and its Modelling” of H. Versteeg, W. Malalasekra, An Introduction to Computational Fluid Dynamics: The Finite Volume Method. Prentice Hall, Second Edition. • Chapter 4 of “I. M. Cohen and P. K. Kundu. Fluid Mechanics. Academic Press, Fourth Edition, 2008” • Chapter 3 on “Turbulence Models” of T. Cebeci, J. P. Shao, F. Kafyeke and E. Laurendeau, Computational Fluid Dynamics for Engineers. Springer, 2005 • Durbin, Paul A., and Gorazd Medic. Fluid dynamics with a computational perspective. Cambridge University Press, 2007. 2.29 Numerical Fluid Mechanics PFJL Lecture 25, 3 Direct Numerical Simulations (DNS) for Turbulent Flows • Most accurate approach – Solve NS with no averaging or approximation other than numerical discretizations whose errors can be estimated/controlled • Simplest conceptually, all is resolved: – Size of domain must be at least a few times the distance L over which fluctuations are correlated (L= largest eddy scale) – Resolution must capture all kinetic energy dissipation, i.e. grid size must be smaller than viscous scale, the Kolmogorov scale, – For homogenous isotropic turbulence, uniform grid is adequate, hence number of grid points (DOFs) in each direction is (Tennekes and Lumley, 1976): 3/4 LO/ ~ (ReLL ) Re UL – In 3D, total cost (if time-step scales as grid size, for stability and/or accuracy): 3 ~OO Re3/4 Re 3/4 (Re3 ) LL L • CPU and RAM limit the size of the problem: 6 – 10 Peta-Flops/s for 1 hour: Re L ~ 3.310 (extremely optimistic) – Largest DNS ever performed up to 2013: 15360 x 1536 x 11520 mesh, ReL 5200 • https://www.alcf.anl.gov/articles/first-mira-runs-break-new-ground-turbulence-simulations 2.29 Numerical Fluid Mechanics PFJL Lecture 25, 4 Direct Numerical Simulations (DNS) for Turbulent Flows: Numerics • DNS likely gives more information that many engineers need (closer to experimental data) • But, it can be used for turbulence studies, e.g. coherent structures dynamics and other fundamental research – Allow to construct better RANS models or even correlation models • Numerical Methods for DNS DNS, Backward facing step – All NS solvers we have seen are useful Le and Moin (2008) © source unknown. All rights reserved. This content is – Small time-steps required for bounded errors: excluded from our Creative Commons license. For more information, see http://ocw.mit.edu/help/faq-fair-use/. – Explicit methods are fine in simple geometries (stability satisfied due to small time-step needed for accuracy) – Implicit methods near boundaries or complex geometries (large derivatives in viscous terms normal to the walls can lead to numerical instabilities ⇒ treated implicitly) 2.29 Numerical Fluid Mechanics PFJL Lecture 25, 5 Direct Numerical Simulations (DNS) for Turbulent Flows: Numerics, Cont’d • Time-marching methods commonly used – Explicit 2nd to 4th order accurate (Runge-Kutta, Adams-Bashforth, Leapfrog): R-K’s often more accurate for same cost • For same order of accuracy, R-K’s allow larger time-steps – Crank-Nicolson often used for implicit schemes • Must be conservative, including kinetic energy • Spatial discretization schemes should have low dissipation – Upwind schemes often too diffusive: error larger than molecular diffusion! – High-order finite difference – Spectral methods (use Fourier series to estimate derivatives) • Mainly useful for simple (periodic) geometries (FFT) • Use spectral elements instead (Patera, Karnadiakis, etc) – (Hybridizable)-(Discontinuous)-Galerkin (FE Methods): Cockburn et al. 2.29 Numerical Fluid Mechanics PFJL Lecture 25, 6 Direct Numerical Simulations (DNS) for Turbulent Flows: Numerics, Cont’d • Challenges: – Storage for states at intermediate time steps (⇒ R-K’s of low storage) – Total discretization error and turbulence spectrum • Total error: both order of discretization and values of derivatives (spectrum) Measure of total error: integrate over whole turbulent spectrum – Difficult to measure accuracy due to (unstable) nature of turbulent flow • Due to predictability limit of turbulence • Hence, statistical properties of two solutions are often compared – Simplest measure: turbulent spectrum – Generating initial conditions: as much art as science • Initial conditions remembered over significant “eddy-turnover” time • Data assimilation, smoothing schemes to obtain ICs – Generating boundary conditions • Periodic for simple problems, Radiating/Sponge conditions for realistic cases 2.29 Numerical Fluid Mechanics PFJL Lecture 25, 7 Example: Spatial Decay of Turbulence Created by an Oscillating Boundary Briggs et al (1996) – Oscillating grid on top of quiescent fluid creates turbulence – Decays in intensity away from © Springer. All rights reserved. This content is excluded from our Creative grid by “turbulent diffusion”: Commons license. For more information, see http://ocw.mit.edu/fairuse. Source: Ferziger, J. and M. Peric. Computational Methods for Fluid Dynamics. stirring + mixing 3rd ed. Springer, 2001. – Used spectral method, periodic, 3rd order R-K – DNS results agree with data • Used to test turbulence “closure” models • Did not work well because not derived for that “type” of © Springer. All rights reserved. This content is excluded from our Creative Commons license. For more information, see http://ocw.mit.edu/fairuse. turbulence Source: Ferziger, J. and M. Peric. Computational Methods for Fluid Dynamics. 3rd ed. Springer, 2001. Note: DNS have at times found out when laboratory set-up was not proper 2.29 Numerical Fluid Mechanics PFJL Lecture 25, 8 Reynolds-averaged Navier-Stokes (RANS) • Many science and engineering applications focus on averages • RANS models: based on ideas of Osborne Reynolds – All “unsteadiness” regarded as part of turbulence and averaged out – By averaging, nonlinear terms in NS eqns. lead to new product terms that must be modeled • Separation into mean and fluctuations TT0 – Moving time-average: u u u'; ( xti ,) ( xti ,) ( xti ,) tT /2 l 0 where (xt , ) ( xtdt , ) ; i.e. ( xt , ) 0 i T i i 0 tT 0 /2 – Ensemble average: u u u' N u' l r u (xtii ,) (xt ,) N r1 u T t t (A) (B) – Reynolds-averaging: either of the Graphs showing (A) the time average for a statistically steady flow and (B) the ensemble average for an unsteady flow. above two averages Image by MIT OpenCourseWare. 2.29 Numerical Fluid Mechanics PFJL Lecture 25, 9 Reynolds-averaged Navier-Stokes (RANS) • Variance, r.m.s. and higher-moments: tT /2 l 0 22(xt ,) (x ,) t dt u( u u )( ) u u i T i ii ii 0 tT 0 /2 2 rms tT /2 l 0 pp(xt ,) (x , t ) dt with p 3,4, etc iiT 0 tT 0 /2 • Correlations: – In time: R(t12,t; x) u'(xt, 12) u'(xt, ) for a stationary process : R(; x) u'(xt,) u'(xt, ) – In space: Rxxt(12 , ; ) uxtuxt '(12 , ) '( , ) for a homogeneous process :R ( ; t ) uxtux '( , ) '( , t ) 1 • Turbulent kinetic energy: k uvw''22 ' 2 2 – Note: some arbitrariness in the decomposition uuu'; and in the definition that “fluctuations = turbulence” 2.29 Numerical Fluid Mechanics PFJL Lecture 25, 10 Reynolds-averaged Navier-Stokes (RANS) • Continuity and Momentum Equations, incompressible: u i 0 xi up()uu i i j + ij t xj xi x j – Applying either the ensemble or time-averages to these equations leads to the RANS eqns. – In both cases, averaging any linear term in conservation equation gives the identical term, but for the average quantity • Average the equations, inserting the decomposition: ui u i u i – the time and space derivatives commute with the averaging operator uu ii xxii uu ii tt 2.29 Numerical Fluid Mechanics PFJL Lecture 25, 11 Reynolds-averaged Navier-Stokes (RANS) • Averaged continuity and momentum equations:

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    34 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us