湍流中平均量的灵敏度计算
Toward computing sensitivities of average quantities in turbulent flows
摘要:
混沌动力系统,如湍流,其特征在于无穷小扰动对初始条件的指数发散。因此,传统的伴随/切线灵敏度分析方法,是成功的RANS模拟失败的情况下,混沌LES/DNS。在这项工作中,我们讨论了现有方法的局限性,包括基于集成和基于阴影的灵敏度方法,提出了替代传统的灵敏度分析。我们提出了一种新的替代方案,称为空间分割灵敏度(S3)算法,这是计算效率和解决这些限制。在这项工作中,推导的S3算法中的特殊情况下,系统收敛到一个平稳的分布,可以表示在相空间中的概率密度函数无处不在。低维混沌映射的数值例子进行了讨论,其中S3计算与有限差分结果显示出良好的一致性,表明该方法在更普遍的发展潜力。
英文摘要:
Chaotic dynamical systems such as turbulent flows are characterized by an exponential divergence of infinitesimal perturbations to initial conditions. Therefore, conventional adjoint/tangent sensitivity analysis methods that are successful with RANS simulations fail in the case of chaotic LES/DNS. In this work, we discuss the limitations of current approaches, including ensemble-based and shadowing-based sensitivity methods, that were proposed as alternatives to conventional sensitivity analysis. We propose a new alternative, called the space-split sensitivity (S3) algorithm, that is computationally efficient and addresses these limitations. In this work, the derivation of the S3 algorithm is presented in the special case where the system converges to a stationary distribution that can be expressed with a probability density function everywhere in phase-space. Numerical examples of low-dimensional chaotic maps are discussed where S3 computation shows good agreement with finite-difference results, indicating potential for the development of the method in more generality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。