Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRobust FEM-based extraction of finite-time coherent sets using scattered, sparse, and incomplete trajectories
262
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
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.
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.
Nonstandard ergodic averages can be defined for a measure-preserving action of a group on a probability space, as a natural extension of classical (nonstandard) ergodic averages. We extend the one-dimensional theory, obtaining L^1 pointwise ergodic theorems for several kinds of nonstandard sparse group averages, with a special focus on the group Z^d. Namely, we extend results for sparse block averages and sparse random averages to their analogues on virtually nilpotent groups, and extend Christs result for sparse deterministic sequences to its analogue on Z^d. The second and third results have two nontrivial variants on Z^d: a native d-dimensional average and a product average from the 1-dimensional averages.
We present a convergence proof of the projective integration method for a class of deterministic multi-dimensional multi-scale systems which are amenable to centre manifold theory. The error is shown to contain contributions associated with the numerical accuracy of the microsolver, the numerical accuracy of the macrosolver and the distance from the centre manifold caused by the combined effect of micro- and macrosolvers, respectively. We corroborate our results by numerical simulations.
In order to analyze structure of tangent spaces of a transient orbit, we propose a new algorithm which pulls back vectors in tangent spaces along the orbit by using a calculation method of covariant Lyapunov vectors. As an example, the calculation algorithm has been applied to a transient orbit converging to an equilibrium in a three-dimensional ordinary differential equations. We obtain vectors in tangent spaces that converge to eigenvectors of the linearized system at the equilibrium. Further, we demonstrate that an appropriate perturbation calculated by the vectors can lead an orbit going in the direction of an eigenvector of the linearized system at the equilibrium.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
