Suppr超能文献

从有限数量的拉格朗日数据中识别有限时间相干集。

Identifying finite-time coherent sets from limited quantities of Lagrangian data.

作者信息

Williams Matthew O, Rypina Irina I, Rowley Clarence W

机构信息

Program in Applied and Computational Mathematics, Princeton University, New Jersey 08544, USA.

Department of Physical Oceanography, Woods Hole Oceanographic Institute, Massachusetts 02543, USA.

出版信息

Chaos. 2015 Aug;25(8):087408. doi: 10.1063/1.4927424.

Abstract

A data-driven procedure for identifying the dominant transport barriers in a time-varying flow from limited quantities of Lagrangian data is presented. Our approach partitions state space into coherent pairs, which are sets of initial conditions chosen to minimize the number of trajectories that "leak" from one set to the other under the influence of a stochastic flow field during a pre-specified interval in time. In practice, this partition is computed by solving an optimization problem to obtain a pair of functions whose signs determine set membership. From prior experience with synthetic, "data rich" test problems, and conceptually related methods based on approximations of the Perron-Frobenius operator, we observe that the functions of interest typically appear to be smooth. We exploit this property by using the basis sets associated with spectral or "mesh-free" methods, and as a result, our approach has the potential to more accurately approximate these functions given a fixed amount of data. In practice, this could enable better approximations of the coherent pairs in problems with relatively limited quantities of Lagrangian data, which is usually the case with experimental geophysical data. We apply this method to three examples of increasing complexity: The first is the double gyre, the second is the Bickley Jet, and the third is data from numerically simulated drifters in the Sulu Sea.

摘要

提出了一种数据驱动的方法,用于从有限数量的拉格朗日数据中识别时变流中的主要输运障碍。我们的方法将状态空间划分为相干对,相干对是一组初始条件,其选择方式是在预先指定的时间间隔内,使在随机流场影响下从一组“泄漏”到另一组的轨迹数量最小化。在实际应用中,这种划分是通过求解一个优化问题来计算的,以获得一对函数,其符号决定集合成员关系。根据之前处理合成的、“数据丰富”测试问题的经验,以及基于佩龙 - 弗罗贝尼乌斯算子近似的概念相关方法,我们观察到感兴趣的函数通常看起来是平滑的。我们利用与谱方法或“无网格”方法相关的基集来利用这一特性,因此,在给定固定数据量的情况下,我们的方法有可能更准确地逼近这些函数。在实际应用中,这可以在拉格朗日数据量相对有限的问题中更好地逼近相干对,而实验地球物理数据通常就是这种情况。我们将此方法应用于三个复杂度不断增加的例子:第一个是双涡旋,第二个是比克利急流,第三个是苏禄海数值模拟漂流器的数据。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验