Generating high resolution DNS for LES comparisons.

生成高分辨率 DNS 以进行 LES 比较。

• 批准号: EP/C007921/1
• 负责人: Robert Kerr
• 金额: $ 11.56万
• 依托单位: University of Warwick
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2006
• 资助国家: 英国
• 起止时间: 2006 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FC007921%2F1
• 关键词: Generating; resolution; DNS; LES; comparisons.

Direct numerical simulations (DNS) of turbulent flows provide one of the primary data sets for comparing new models for turbulence against. This is despite limitations in the types of flows that DNS can study at high Reynolds numbers. The limitation for incompressible flows is that for efficient solution of the Poisson equation for pressure, Fourier decomposition in two or three directions is traditionally required. This has meant that the only reliable high Reynolds number DNS available is either in fully periodic flows or flows with one simple direction such as plane channel flow. The focus of this studentship would be the generation of high Reynolds number DNS for more complicated geometries and comparisons with a variety of LES models for these flows.DNS calculations of flow over a backward facing step, a square duct andsmooth, irregular terrain would be done with a state-of-the-art efficient spectral element code. Validation will be done with a finite volume code, which will be used for most of our LES calculations. The LES comparisons will be to our new mixed nonlinear model and similar models such as the Met Office stochastic model.

湍流的直接数值模拟提供了比较新湍流模型的主要数据集之一。这是尽管在高雷诺数的情况下，DNS可以研究的流动类型存在局限性。对于不可压缩流动的限制是，为了有效地求解压力的泊松方程，传统上需要在两个或三个方向上进行傅立叶分解。这意味着，唯一可靠的高雷诺数流动模型要么是全周期流动，要么是单一方向的流动，如平面槽道流动。这项研究的重点将是为更复杂的几何形状生成高雷诺数的数值模拟，并与这些流动的各种大涡模拟进行比较。对于后向台阶、方形管道和平坦、不规则地形上的流动，将使用最先进的高效谱元素程序进行数值模拟计算。验证将使用有限体积代码进行，该代码将用于我们的大多数大涡模拟计算。LES将与我们新的混合非线性模型和类似的模型(如英国气象局随机模型)进行比较。

项目成果

Direct numerical simulation of turbulent flow over a backward-facing step

• DOI: 10.1017/s0022112096003941
• 发表时间: 1997-01-10
• 期刊: JOURNAL OF FLUID MECHANICS
• 影响因子: 3.7
• 作者: Le, H;Moin, P;Kim, J
• 通讯作者: Kim, J