Code
For transfer operator and dynamic laplacian computations.
For transfer operator and dynamic laplacian computations.
When searching for several to many almost-invariant sets or coherent sets, these sets sometimes need to be disentangled from several eigenvectors. The paper and code below perform this separation automatically by representing the eigenspace spanned by the eigenvectors in a basis whose vectors are sparse. Each of the vectors in this basis is supported on a single almost-invariant or coherent set.
Mesh-based method of computing finite-time coherent sets, particularly suited for sparse, scattered trajectories such as those obtained by physical observations (e.g. drifters, floats, etc...).
Below are slides and code for a tutorial on transfer operator methods, presented at a Banff Workshop in 2013