Department of Mechanical and Aerospace Engineering, Princeton University, Princeton, New Jersey 08544, USA.
Chaos. 2010 Mar;20(1):017503. doi: 10.1063/1.3270044.
This paper presents new efficient methods for computing finite-time Lyapunov exponent (FTLE) fields in unsteady flows. The methods approximate the particle flow map, eliminating redundant particle integrations in neighboring flow map calculations. Two classes of flow map approximations are investigated based on composition of intermediate flow maps; unidirectional approximation constructs a time-T map by composing a number of smaller time-h maps, while bidirectional approximation constructs a flow map by composing both positive- and negative-time maps. The unidirectional method is shown to be fast and accurate, although it is memory intensive. The bidirectional method is also fast and uses significantly less memory; however, it is prone to error which is large in regions where the opposite-time FTLE field is large, rendering it unusable. The algorithms are implemented and compared on three example fluid flows: a double gyre, a low Reynolds number pitching flat plate, and an unsteady ABC flow.
本文提出了新的有效方法,用于计算非定常流中的有限时间李雅普诺夫指数 (FTLE) 场。这些方法通过消除相邻流图计算中的冗余粒子积分来逼近粒子流图。本文基于中间流图的组合研究了两类流图逼近方法;单向逼近通过组合多个较小的时间-h 映射来构建时间-T 映射,而双向逼近通过组合正时间和负时间映射来构建流图。单向方法快速且准确,尽管它需要大量的内存。双向方法也很快,并且使用的内存显著减少;然而,它容易出错,在相反时间 FTLE 场较大的区域,误差很大,导致其无法使用。本文在三个示例流场(双回旋流、低雷诺数俯仰平板流和非定常 ABC 流)上实现和比较了这些算法。