QUANTIFYING LOCAL INSTABILITY AND PREDICTABILITY OF CHAOTIC DYNAMICAL SYSTEMS BY MEANS OF LOCAL METRIC ENTROPY

2000 ◽  
Vol 10 (01) ◽  
pp. 135-154 ◽  
Author(s):  
MOZHENG WEI

A local metric entropy (LME) is introduced and used as a measure of local instability of chaotic dynamical systems. The predictability time scale of a dynamical system during a given period of time can also be estimated with high accuracy by using the LME. It is shown that LME, at any time during the evolution of a dynamical system, can be calculated as the sum of all the positive local Lyapunov exponents (LEs). This conclusion implies that the positive local LEs represent the rates of local information changes along the directions of their respective Lyapunov vectors. LME does not depend upon the amplitudes nor the configurations of initial perturbations; it depends on the positive local LEs which are intrinsic properties of dynamical systems. In addition, the sum of all the local LEs is proven to be equal to the divergence of phase space. Thus for a general chaotic system at any time, the sum of all the local LEs is equal to the sum of all the local growth rates of either instantaneous optimal modes or normal modes. In analyzing local instability, the performance of LME is evaluated by comparing an instability index with LME, the first local LE, locally largest LE, local growth rates of the dominant instantaneous optimal mode and normal mode. When LME is used to estimate the predictability time scales of systems over specified time periods, it is found that the time scales defined by LME are generally closer to the standard predictability times than the Lyapunov times and Kolmogorov–Sinai times for most cases in the two dynamical systems we have tested. Both the instability index and standard predictability time are defined and calculated through a large number of random errors.

Author(s):  
Lionel Rosier

In this chapter, we consider a class of discrete dynamical systems defined on the homogeneous space associated with a regular tiling of RN, whose most familiar example is provided by the N-dimensional torus TN. It is proved that any dynamical system in this class is chaotic in the sense of Devaney, and that it admits at least one positive Lyapunov exponent. Next, a chaos-synchronization mechanism is introduced and used for masking information in a communication setup.


2014 ◽  
Vol 1 (1) ◽  
Author(s):  
Christoph Kawan

AbstractWe introduce the notion of metric entropy for a nonautonomous dynamical system given by a sequence (X


1996 ◽  
Vol 06 (12a) ◽  
pp. 2389-2399 ◽  
Author(s):  
PHIL DIAMOND ◽  
ALEXEI POKROVSKII

When a dynamical system is realized on a computer, the computation is of a discretization, where finite machine arithmetic replaces continuum state space. For chaotic dynamical systems, the discretizations often have collapsing effects to a fixed point or to short cycles. Statistical properties of this phenomenon can be modeled by random mappings with an absorbing center. The model gives results which are very much in line with computational experiments and there appears to be a type of universality summarised by an Arcsine Law. The effects are discussed with special reference to the family of mappings fl(x)=1−|1−2x|l,x∈[0, 1], 1<l≤2. Computer experiments show close agreement with predictions of the model.


Author(s):  
Christos Volos ◽  
Ioannis Kyprianidis ◽  
Ioannis Stouboulos ◽  
Sundarapandian Vaidyanathan

In the last decade, a very interesting relationship between cryptography and chaos theory was developed. As a result of this close relationship, several chaos-based cryptosystems, especially using autonomous chaotic dynamical systems, have been put forward. However, this chapter presents a novel Chaotic Random Bit Generator (CRBG), which is based on the Poincaré map of a non-autonomous dynamical system. For this reason, the very-well known Duffing-van der Pol system has been used. The proposed CRBG also uses the X-OR function for improving the “randomness” of the produced bit streams, which are subjected to the most stringent statistical tests, the FIPS-140-2 suite tests, to detect the specific characteristics that are expected from random bit sequences.


2008 ◽  
Vol 18 (05) ◽  
pp. 1531-1537 ◽  
Author(s):  
AYUB KHAN ◽  
PREMPAL SINGH

Chaos synchronization of nonlinear dynamical systems has been studied through theoretical and numerical techniques. For the synchronization of two identical nonlinear chaotic dynamical systems a theorem has been constructed based on the Lyapunov function, which requires a minimal knowledge of system's structure to synchronize with an identical response system. Numerical illustrations have been provided to verify the theorem.


2020 ◽  
pp. 2150021
Author(s):  
Xinsheng Wang ◽  
Weisheng Wu ◽  
Yujun Zhu

Let [Formula: see text] be a [Formula: see text] random partially hyperbolic dynamical system. For the unstable foliation, the corresponding unstable metric entropy, unstable topological entropy and unstable pressure via the dynamics of [Formula: see text] on the unstable foliation are introduced and investigated. A version of Shannon–McMillan–Breiman Theorem for unstable metric entropy is given, and a variational principle for unstable pressure (and hence for unstable entropy) is obtained. Moreover, as an application of the variational principle, equilibrium states for the unstable pressure including Gibbs [Formula: see text]-states are investigated.


2005 ◽  
Vol 15 (03) ◽  
pp. 471-481 ◽  
Author(s):  
JOHAN JANSSON ◽  
CLAES JOHNSON ◽  
ANDERS LOGG

In this short note, we discuss the basic approach to computational modeling of dynamical systems. If a dynamical system contains multiple time scales, ranging from very fast to slow, computational solution of the dynamical system can be very costly. By resolving the fast time scales in a short time simulation, a model for the effect of the small time scale variation on large time scales can be determined, making solution possible on a long time interval. This process of computational modeling can be completely automated. Two examples are presented, including a simple model problem oscillating at a time scale of 10–9 computed over the time interval [0,100], and a lattice consisting of large and small point masses.


1996 ◽  
Vol 06 (11) ◽  
pp. 2119-2125 ◽  
Author(s):  
D. GLIGOROSKI ◽  
D. DIMOVSKI ◽  
L. KOCAREV ◽  
V. URUMOV ◽  
L.O. CHUA

We suggest a method for encoding messages by chaotic dynamical systems. The main idea is that by targeting the trajectories of some chaotic dynamical system with time constraint, someone can send a information to the remote recipient. The concept is based on setting receptors in the phase space of the dynamical system, and then targeting the trajectory between them. We considered the time of arriving from one receptor to another as a carrier of information obtained by searching in the table of values for arriving times.


2007 ◽  
Vol 5 ◽  
pp. 195-200
Author(s):  
A.V. Zhiber ◽  
O.S. Kostrigina

In the paper it is shown that the two-dimensional dynamical system of equations is Darboux integrable if and only if its characteristic Lie algebra is finite-dimensional. The class of systems having a full set of fist and second order integrals is described.


Entropy ◽  
2021 ◽  
Vol 23 (3) ◽  
pp. 379
Author(s):  
Miguel Abadi ◽  
Vitor Amorim ◽  
Sandro Gallo

From a physical/dynamical system perspective, the potential well represents the proportional mass of points that escape the neighbourhood of a given point. In the last 20 years, several works have shown the importance of this quantity to obtain precise approximations for several recurrence time distributions in mixing stochastic processes and dynamical systems. Besides providing a review of the different scaling factors used in the literature in recurrence times, the present work contributes two new results: (1) For ϕ-mixing and ψ-mixing processes, we give a new exponential approximation for hitting and return times using the potential well as the scaling parameter. The error terms are explicit and sharp. (2) We analyse the uniform positivity of the potential well. Our results apply to processes on countable alphabets and do not assume a complete grammar.


Sign in / Sign up

Export Citation Format

Share Document