The mesochronic velocity is the average of the velocity field along trajectories generated by the same velocity field over a time interval of finite duration. In this paper we classify initial conditions of trajectories evolving in incompressible vec
tor fields according to the character of motion of material around the trajectory. In particular, we provide calculations that can be used to determine the number of expanding directions and the presence of rotation from the characteristic polynomial of the Jacobian matrix of mesochronic velocity. In doing so, we show that (a) the mesochronic velocity can be used to characterize dynamical deformation of three-dimensional volumes, (b) the resulting mesochronic analysis is a finite-time extension of the Okubo--Weiss--Chong analysis of incompressible velocity fields, (c) the two-dimensional mesochronic analysis from Mezic et al. emph{A New Mixing Diagnostic and Gulf Oil Spill Movement}, Science 330, (2010), 486-489, extends to three-dimensional state spaces. Theoretical considerations are further supported by numerical computations performed for a dynamical system arising in fluid mechanics, the unsteady Arnold--Beltrami--Childress (ABC) flow.
Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of attractor,
update rules and update orders. We prove results on attractors for different utility functions and update orders. For complete graphs we characterize attractors for synchronous and sequential update rules. In other cases (for $k$-regular graphs or for different update orders) we provide sufficient conditions for attractivity of full cooperation and full defection. We construct examples to show that these conditions are not necessary. Finally, by formulating a list of open questions we emphasize the advantages of our rigorous approach.
In this paper, we present an iterative three-point method with memory based on the family of Kings methods to solve nonlinear equations. This proposed method has eighth order convergence and costs only four function evaluations per iteration which su
pports the Kung-Traub conjecture on the optimal order of convergence. An acceleration of the convergence speed is achieved by an appropriate variation of a free parameter in each step. This self accelerator parameter is estimated using Newtons interpolation polynomial of fourth degree. The order of convergence is increased from 8 to 12 without any extra function evaluation. Consequently, this method, possesses a high computational efficiency. Finally, a numerical comparison of the proposed method with related methods shows its effectiveness and performance in high precision computations.
For nonautonomous linear difference equations, we introduce the notion of the so-called nonuniform dichotomy spectrum and prove a spectral theorem. Moreover, we introduce the notion of weak kinematical similarity and prove a reducibility result by the spectral theorem.
We introduce a new concept of finite-time entropy which is a local version of the classical concept of metric entropy. Based on that, a finite-time version of Pesins entropy formula and also an explicit formula of finite-time entropy for $2$-D system
s are derived. We also discuss about how to apply the finite-time entropy field to detect special dynamical structures such as Lagrangian coherent structures.
In this note we prove that a fractional stochastic delay differential equation which satisfies natural regularity conditions generates a continuous random dynamical system on a subspace of a Holder space which is separable.
