Analysis of Streamline Separation at Infinity Using Time-Discrete Markov Chains.

Area of Science:

• Fluid dynamics
• Computational mathematics
• Dynamical systems

Background:

• Current methods for analyzing streamline separation are limited to finite time or local regions.
• There is a need for methods that can evaluate streamline separation over infinite time for steady planar vector fields.

Purpose of the Study:

• To introduce a new algorithm for infinite-time evaluation of steady planar vector fields.
• To unify combinatorial and probabilistic methods for analyzing streamline separation.
• To compute particle distributions instead of single-particle streamlines.

Main Methods:

• The algorithm encodes the flow into a map and then into a transition matrix for each time direction.
• It introduces the concept of separation in time-discrete Markov Chains.
• Particle distributions are computed rather than individual streamlines.

Main Results:

• The developed algorithm allows for infinite-time evaluation of steady planar vector fields.
• It unifies combinatorial and probabilistic approaches by introducing separation in time-discrete Markov Chains.
• The method computes particle distributions, offering a new perspective on flow analysis.

Conclusions:

• The new method complements existing finite-time analyses by enabling infinite-time evaluations.
• The algorithm's grid-independent nature and unification of methods represent a significant advancement.
• Comparison with Finite-Time Lyapunov Exponents highlights the algorithm's unique insights and potential discrepancies for further research.