pith. sign in

arxiv: 1505.05056 · v4 · pith:LZZK6SG5new · submitted 2015-05-19 · 🧮 math.NA · cs.NA· math.DS

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

classification 🧮 math.NA cs.NAmath.DS
keywords operatorcoherentsetsconstructiontransferapproachbasiscomputation
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.