Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLinear response for the dynamic Laplacian and finite-time coherent sets
73
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Finite-time coherent sets represent minimally mixing objects in general nonlinear dynamics, and are spatially mobile features that are the most predictable in the medium term. When the dynamical system is subjected to small parameter change, one can ask about the rate of change of (i) the location and shape of the coherent sets, and (ii) the mixing properties (how much more or less mixing), with respect to the parameter. We answer these questions by developing linear response theory for the eigenfunctions of the dynamic Laplace operator, from which one readily obtains the linear response of the corresponding coherent sets. We construct efficient numerical methods based on a recent finite-element approach and provide numerical examples.
rate research
Read More
The dynamic Laplace operator arises from extending problems of isoperimetry from fixed manifolds to manifolds evolved by general nonlinear dynamics. Eigenfunctions of this operator are used to identify and track finite-time coherent sets, which physically manifest in fluid flows as jets, vortices, and more complicated structures. Two robust and efficient finite-element discretisation schemes for numerically computing the dynamic Laplacian were proposed in Froyland & Junge (2018). In this work we consider higher-orde
Transport and mixing properties of aperiodic flows are crucial to a dynamical analysis of the flow, and often have to be carried out with limited information. Finite-time coherent sets are regions of the flow that minimally mix with the remainder of the flow domain over the finite period of time considered. In the purely advective setting this is equivalent to identifying sets whose boundary interfaces remain small throughout their finite-time evolution. Finite-time coherent sets thus provide a skeleton of distinct regions around which more turbulent flow occurs. They manifest in geophysical systems in the forms of e.g. ocean eddies, ocean gyres, and atmospheric vortices. In real-world settings, often observational data is scattered and sparse, which makes the difficult problem of coherent set identification and tracking even more challenging. We develop three FEM-based numerical methods to efficiently approximate the dynamic Laplace operator, and introduce a new dynamic isoperimetric problem using Dirichlet boundary conditions. Using these FEM-based methods we rapidly and reliably extract finite-time coherent sets from models or scattered, possibly sparse, and possibly incomplete observed data.
The long-term average response of observables of chaotic systems to dynamical perturbations can often be predicted using linear response theory, but not all chaotic systems possess a linear response. Macroscopic observables of complex dissipative chaotic systems, however, are widely assumed to have a linear response even if the microscopic variables do not, but the mechanism for this is not well-understood. We present a comprehensive picture for the linear response of macroscopic observables in high-dimensional coupled deterministic dynamical systems, where the coupling is via a mean field and the microscopic subsystems may or may not obey linear response theory. We derive stochastic reductions of the dynamics of these observables from statistics of the microscopic system, and provide conditions for linear response theory to hold in finite dimensional systems and in the thermodynamic limit. In particular, we show that for large systems of finite size, linear response is induced via self-generated noise. We present examples in the thermodynamic limit where the macroscopic observable satisfies LRT, although the microscopic subsystems individually violate LRT, as well a converse example where the macroscopic observable does not satisfy LRT despite all microscopic subsystems satisfying LRT when uncoupled. This latter, maybe surprising, example is associated with emergent non-trivial dynamics of the macroscopic observable. We provide numerical evidence for our results on linear response as well as some analytical intuition.
Finite-time coherent sets inhibit mixing over finite times. The most expensive part of the transfer operator approach to detecting coherent sets is the construction of the operator itself. We present a numerical method based on radial basis function collocation and apply it to a recent transfer operator construction that has been designed specifically for purely advective dynamics. The construction is based on a dynamic Laplacian operator and minimises the boundary size of the coherent sets relative to their volume. The main advantage of our new approach is a substantial reduction in the number of Lagrangian trajectories that need to be computed, leading to large speedups in the transfer operator analysis when this computation is costly.
This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice projects densely into the internal space and (possibly after translation) hits each supporting hyperplane of the polytopal window. Our main result is that LR is satisfied if and only if the patterns are of low complexity (property C), and the projected lattice satisfies a Diophantine condition (property D). Property C can be checked by computation of the ranks and dimensions of linear spans of the stabiliser subgroups of the supporting hyperplanes, as investigated in Part I to this article. To define the correct Diophantine condition D, we establish new results on decomposing polytopal cut and project schemes to factors, developing concepts initiated in the work of Forrest, Hunton and Kellendonk. This means that, when C is satisfied, the window splits into components which induce a compatible splitting of the lattice. Then property D is the requirement that, for any suitable decomposition, these factors do not project close to the origin in the internal space, relative to the norm in the total space. On each factor, this corresponds to the usual notion from Diophantine Approximation of a system of linear forms being badly approximable. This extends previous work on cubical cut and project schemes to a very general class of cut and project schemes. We demonstrate our main theorem on several examples, and derive some further consequences of our main theorem, such as the equivalence LR, positivity of weights and satisfying a subadditive ergodic theorem for this class of polytopal cut and project sets.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
