Search results for "Chaotic"

Construction of chaotic dynamical system

2010

The first‐order difference equation xn+ 1 = f(xn ), n = 0,1,…, where f: R → R, is referred as an one‐dimensional discrete dynamical system. If function f is a chaotic mapping, then we talk about chaotic dynamical system. Models with chaotic mappings are not predictable in long‐term. In this paper we consider family of chaotic mappings in symbol space S 2. We use the idea of topological semi‐conjugacy and so we can construct a family of mappings in the unit segment such that it is chaotic. First published online: 09 Jun 2011

Periodic and Chaotic Orbits of a Neuron Model

2015

In this paper we study a class of difference equations which describes a discrete version of a single neuron model. We consider a generalization of the original McCulloch-Pitts model that has two thresholds. Periodic orbits are investigated accordingly to the different range of parameters. For some parameters sufficient conditions for periodic orbits of arbitrary periods have been obtained. We conclude that there exist values of parameters such that the function in the model has chaotic orbits. Models with chaotic orbits are not predictable in long-term.

Chaotic mappings in symbol space

2018

Dissipative rogue wave generation in multiple-pulsing mode-locked fiber laser

2013

Following the first experimental observation of a new mechanism leading to optical rogue wave (RW) formation briefly reported in Lecaplain et al (2012 Phys. Rev. Lett. 108 233901), we provide an extensive study of the experimental conditions under which these RWs can be detected. RWs originate from the nonlinear interactions of bunched chaotic pulses that propagate in a fiber laser cavity, and manifest as rare events of high optical intensity. The crucial influence of the electrical detection bandwidth is illustrated. We also clarify the observation of RWs with respect to other pulsating regimes, such as Q-switching instability, that also lead to L-shaped probability distribution functions.…

Massive evaluation and analysis of Poincar�� recurrences on grids of initial data: a tool to map chaotic diffusion

2020

We present a novel numerical method aimed to characterize global behaviour, in particular chaotic diffusion, in dynamical systems. It is based on an analysis of the Poincar\'e recurrence statistics on massive grids of initial data or values of parameters. We concentrate on Hamiltonian systems, featuring the method separately for the cases of bounded and non-bounded phase spaces. The embodiments of the method in each of the cases are specific. We compare the performances of the proposed Poincar\'e recurrence method (PRM) and the custom Lyapunov exponent (LE) methods and show that they expose the global dynamics almost identically. However, a major advantage of the new method over the known g…

A wavelet-based tool for studying non-periodicity

2010

This paper presents a new numerical approach to the study of non-periodicity in signals, which can complement the maximal Lyapunov exponent method for determining chaos transitions of a given dynamical system. The proposed technique is based on the continuous wavelet transform and the wavelet multiresolution analysis. A new parameter, the \textit{scale index}, is introduced and interpreted as a measure of the degree of the signal's non-periodicity. This methodology is successfully applied to three classical dynamical systems: the Bonhoeffer-van der Pol oscillator, the logistic map, and the Henon map.

Short chaotic strings and their behaviour in the scaling region

2008

Coupled map lattices are a paradigm of higher-dimensional dynamical systems exhibiting spatio-temporal chaos. A special case of non-hyperbolic maps are one-dimensional map lattices of coupled Chebyshev maps with periodic boundary conditions, called chaotic strings. In this short note we show that the fine structure of the self energy of this chaotic string in the scaling region (i.e. for very small coupling) is retained if we reduce the length of the string to three lattice points.

Analytical properties of horizontal visibility graphs in the Feigenbaum scenario

2012

Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown [1] that dynamical systems can be studied from a novel perspective via the use of this method. Specifically, the period-doubling and band-splitting attractor cascades that characterize unimodal maps transform into families of graphs that turn out to be independent of map nonlinearity or other particulars. Here we provide an in depth description of the HV treatment of the Feigenbaum scenario, together with analytical derivations that relate to the degree di…

Feigenbaum graphs: a complex network perspective of chaos

2011

The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a natural graph-theoretical description of nonlinear systems with qualities in the spirit of symbolic dynamics. We support our claim via the case study of the period-doubling and band-splitting attractor cascades that characterize unimodal maps. We provide a universal analytical description of this classic scenario in terms of the horizontal visibility graphs associated with the dynamics within the attractors, that we call Feigenbaum graphs, independent of map…

Discussion: “Chaotic Motion of an Elastic-Plastic Beam” (Poddar, B., Moon, F. C., and Mukherjee, S., 1988, ASME J. Appl. Mech., 55, pp. 185–189)

1988

Discussion on caotic motion of a pinned beam subjected to pulse loading