湍流中统计平稳量的灵敏度计算
Sensitivity computation of statistically stationary quantities in turbulent flows
摘要:
众所周知,线性化的摄动方法,如切线或伴随方程,有限差分和自动微分法的灵敏度分析是不适合湍流。原因是湍流表现出混沌动力学,导致状态的无穷小扰动的范数随时间呈指数增长。因此,这些传统方法不能用于计算控制或设计输入的长时间平均量的导数。基于集合的方法和基于阴影的方法来规避混沌系统中的传统方法的问题,也遭受计算不切实际和缺乏一致性保证,分别。我们介绍了空间分裂灵敏度,或S3算法,这是一个蒙特卡洛方法的混沌灵敏度计算问题。在这项工作中,我们推导出简化的动力学假设下的S3算法,并提出了一个低维的例子混沌的数值验证。
英文摘要:
It is well-known that linearized perturbation methods for sensitivity analysis, such as tangent or adjoint equation-based, finite difference and automatic differentiation are not suitable for turbulent flows. The reason is that turbulent flows exhibit chaotic dynamics, leading to the norm of an infinitesimal perturbation to the state growing exponentially in time. As a result, these conventional methods cannot be used to compute the derivatives of long-time averaged quantities to control or design inputs. The ensemble-based approaches and shadowing-based approaches to circumvent the problems of the conventional methods in chaotic systems, also suffer from computational impracticality and lack of consistency guarantees, respectively. We introduce the space-split sensitivity, or the S3 algorithm, which is a Monte-Carlo approach to the chaotic sensitivity computation problem. In this work, we derive the S3 algorithm under simplifying assumptions on the dynamics and present a numerical validation on a low-dimensional example of chaos.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。