SearcharxivSearch

arXiv · 1510.06756

Point Vortices: Finding Periodic Orbits and their Topological Classification

Abstract

The motion of point vortices constitutes an especially simple class of solutions to Euler's equation for two dimensional, inviscid, incompressible, and irrotational fluids. In addition to their intrinsic mathematical importance, these solutions are also physically relevant. Rotating superfluid helium can support rectilinear quantized line vortices, which in certain regimes are accurately modeled by point vortices. Depending on the number of vortices, it is possible to have either regular integrable motion or chaotic motion. Thus, the point vortex model is one of the simplest and most tractable fluid models which exhibits some of the attributes of weak turbulence. The primary aim of this work is to find and classify periodic orbits, a special class of solutions to the point vortex problem. To achieve this goal, we introduce a number of algorithms: Lie transforms which ensure that the equations of motion are accurately solved; constrained optimization which reduces close return orbits to true periodic orbits; object-oriented representations of the braid group which allow for the topological comparison of periodic orbits. By applying these ideas, we accumulate a large data set of periodic orbits and their associated attributes. To render this set tractable, we introduce a topological classification scheme based on a natural decomposition of mapping classes. Finally, we consider some of the intriguing patterns which emerge in the distribution of periodic orbits in phase space. Perhaps the most enduring theme which arises from this investigation is the interplay between topology and geometry. The topological properties of a periodic orbit will often force it to have certain geometric properties.

Explore related subjects

Keep this discovery

BibTeXRIS

Spencer A. Smith. 2015-10-22. Point Vortices: Finding Periodic Orbits and their Topological Classification. https://arxiv.org/abs/1510.06756

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD