z-logo
Premium
Finite element implementation of k − ω SST with automatic wall treatment and adjoint‐based mesh adaptation
Author(s) -
Carrier Alexandre
Publication year - 2021
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.4905
Subject(s) - polygon mesh , laminar flow , airfoil , discretization , turbulence , computer science , finite element method , reynolds number , flow (mathematics) , mesh generation , mathematics , mathematical optimization , algorithm , computational science , mechanics , geometry , physics , mathematical analysis , computer graphics (images) , thermodynamics
Summary This work presents a new methodology in finite element to simulate, according to a controlled precision on an engineering value, steady turbulent flows. First, we developed a new implementation of Reynolds‐averaged Navier‐Stokes equations combined with k − ω SST turbulence model and automatic wall treatment. Then, to simulate these complex multiscale flows, spatial discretization is critical. It is still common for expert users to generate meshes manually since they can roughly anticipate the physics of the flow. However, this remains a difficult task, especially for a neophyte. A recent mesh adaptation methodology based on an adjoint sensitivity analysis allows generating automatically appropriate meshes for analysis of steady laminar flows. Here, we extended this work to turbulent flows. The presentation is limited to two‐dimensional (2D) to demonstrate the effectiveness of the approach without getting unnecessarily entangled in the implementation details. The methodology is validated on the classic 2D zero pressure gradient flat plate verification case at Re  = 5 · 10 6 . Then, a more complex example is also presented: flow around multicomponent airfoil (30P30N, α = 16 . 2 1 ∘) at Re  = 9 · 10 6 .

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here