SearcharxivSearch

arXiv · 1701.05620

Designing a Finite-Time Mixer: Optimizing Stirring for Two-Dimensional Maps

Abstract

Mixing of a passive scalar in a fluid flow results from a two part process in which large gradients are first created by advection and then smoothed by diffusion. We investigate methods of designing efficient stirrers to optimize mixing of a passive scalar in a two-dimensional nonautonomous, incompressible flow over a finite time interval. The flow is modeled by a sequence of area-preserving maps whose parameters change in time, defining a mixing protocol. Stirring efficiency is measured by a negative Sobolev seminorm; its decrease implies creation of fine scale structure. A Perron-Frobenius operator is used to numerically advect the scalar for two examples: compositions of Chirikov standard maps and of Harper maps. In the former case, we find that a protocol corresponding to a single vertical shear composed with horizontal shearing at all other steps is nearly optimal. For the Harper maps, we devise a predictive, one-step scheme to choose appropriate fixed point stabilities and to control the Fourier spectrum evolution to obtain a near optimal protocol.

Explore related subjects

Keep this discovery

BibTeXRIS

R. A. Mitchell, J. D. Meiss. 2017-01-19. Designing a Finite-Time Mixer: Optimizing Stirring for Two-Dimensional Maps. https://doi.org/10.1137/16m1107139

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