Premium
Trajectory‐based computational study of coherent behavior in flows
Author(s) -
PadbergGehle Kathrin,
Schneide Christiane
Publication year - 2017
Publication title -
pamm
Language(s) - English
Resource type - Journals
ISSN - 1617-7061
DOI - 10.1002/pamm.201710004
Subject(s) - trajectory , computer science , coherence (philosophical gambling strategy) , lagrangian coherent structures , cluster analysis , context (archaeology) , graph , flow (mathematics) , algorithm , lagrangian , dynamical systems theory , phase space , theoretical computer science , mathematical optimization , mathematics , artificial intelligence , physics , quantum mechanics , paleontology , statistics , geometry , astronomy , vortex , biology , thermodynamics
Abstract The notion of coherence in time‐dependent dynamical systems is used to describe mobile sets that do not freely mix with the surrounding regions in phase space. In particular, coherent behavior has an impact on transport and mixing processes in fluid flows. The mathematical definition and numerical study of coherent structures in flows has received considerable scientific interest for about two decades. However, mathematically sound methodologies typically require full knowledge of the flow field or at least high resolution trajectory data, which may not be available in applications. Recently, different computational methods have been proposed to identify coherent behavior in flows directly from Lagrangian trajectory data, such as obtained from particle tracking algorithms. In this context, spatio‐temporal clustering algorithms have been proven to be very effective for the extraction of coherent sets from sparse and possibly incomplete trajectory data. Inspired by these recent approaches, we consider an unweighted, undirected network, in which Lagrangian particle trajectories serve as network nodes. A link is established between two nodes if the respective trajectories come close to each other at least once in the course of time. Classical graph algorithms are then employed to analyze the resulting network. In particular, spectral graph partitioning schemes allow us to extract coherent sets of the underlying flow. (© 2017 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)