On fast computation of finite-time coherent sets using radial basis functions

Abstract

Finite-time coherent sets inhibit mixing over finite times. The most expensive part of the transfer operator approach to detecting coherent sets is the construction of the operator itself. We present a numerical method based on radial basis function collocation and apply it to a recent transfer operator construction that has been designed specifically for purely advective dynamics. The construction is based on a "dynamic" Laplacian operator and minimises the boundary size of the coherent sets relative to their volume. The main advantage of our new approach is a substantial reduction in the number of Lagrangian trajectories that need to be computed, leading to large speedups in the transfer operator analysis when this computation is costly.

References in corpus (2)

• Multiscale Mixing Efficiencies for Steady Sources
• Cutting and Shuffling a Line Segment: Mixing by Interval Exchange Transformations

Cited by in corpus (9)

• A Critical Comparison of Lagrangian Methods for Coherent Structure Detection
• On the numerical approximation of the Perron-Frobenius and Koopman operator
• A Spectral Clustering Approach to Lagrangian Vortex Detection
• Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification
• A dynamic Laplacian for identifying Lagrangian coherent structures on weighted Riemannian manifolds
• Detecting Lagrangian coherent structures from sparse and noisy trajectory data
• Kernel methods for detecting coherent structures in dynamical data
• A Geometric Heat-Flow Theory of Lagrangian Coherent Structures
• Deep Lagrangian connectivity in the global ocean inferred from Argo floats