Search results for "Attractor"
showing 10 items of 162 documents
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…
Detecting tri‐stability of 3D models with complex attractors via meshfree reconstruction of invariant manifolds of saddle points
2018
In mathematical modeling it is often required the analysis of the vector field topology in order to predict the evolution of the variables involved. When a dynamical system is multi-stable the trajectories approach different stable states, depending on the initialmconditions. The aim of this work is the detection of the invariant manifolds of thesaddle points to analyze the boundaries of the basins of attraction. Once that a sufficient number of separatrix points is found a Moving Least Squares meshfree method is involved to reconstruct the separatrix manifolds. Numerical results are presented to assess the method referring to tri-stable models with complex attractors such as limit cycles o…
Noise-induced transitions in a stochastic Goodwin-type business cycle model
2017
Abstract We motivate and specify a stochastic Goodwin-type business cycle model. Our analysis focusses on a subset of the parameter space where several attractors coexist. Applying a semi-numerical approach based on the stochastic sensitivity function and confidence domains due to Milstein and Ryashko (1995) , we study random transitions between stable attractors in the context of the Goodwin-type economy embedded in an uncertain environment. Relying on a mix of analytical considerations and simulations we demonstrate that under weak noise levels regime switching is a prominent feature in the presence of low saving rates. Moreover, we explain how increased uncertainty can induce an essentia…
Hidden oscillations in stabilization system of flexible launcher with saturating actuators
2013
Abstract In the paper the attitude stabilization system of the unstable flexible launcher with saturating input is considered. It is demonstrated that due to actuator saturation the system performance can significantly degrade. The analytical-numerical method is applied to demonstrate possibility of hidden oscillations and localize their attractor.
Transient dynamics of pulse-driven memristors in the presence of a stable fixed point
2019
Abstract Some memristors are quite interesting from the point of view of dynamical systems. When driven by narrow pulses of alternating polarities, their dynamics has a stable fixed point, which may be useful for future applications. We study the transient dynamics of two types of memristors characterized by a stable fixed point using a time-averaged evolution equation. Time-averaged trajectories of the Biolek window function memristor and resistor-threshold type memristor circuit (an effective memristor) are determined analytically, and the times of relaxation to the stable fixed point are found. Our analytical results are in perfect agreement with the results of numerical simulations.
String attractors and combinatorics on words
2019
The notion of \emph{string attractor} has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word $w=w[1]w[2]\cdots w[n]$ is a subset $\Gamma$ of the positions $\{1,\ldots,n\}$, such that all distinct factors of $w$ have an occurrence crossing at least one of the elements of $\Gamma$. While finding the smallest string attractor for a word is a NP-complete problem, it has been proved in [Kempa and Prezza, 2018] that dictionary compressors can be interpreted as algorithms approximating the smallest string attractor for a given word. In this paper we explore the noti…
Avoiding strange attractors in efficient parametric families of iterative methods for solving nonlinear problems
2019
[EN] Searching zeros of nonlinear functions often employs iterative procedures. In this paper, we construct several families of iterative methods with memory from one without memory, that is, we have increased the order of convergence without adding new functional evaluations. The main aim of this manuscript yields in the advantage that the use of real multidimensional dynamics gives us to decide among the different classes designed and, afterwards, to select its most stable members. Moreover, we have found some elements of the family whose behavior includes strange attractors of different kinds that must be avoided in practice. In this sense, Feigenbaum diagrams have resulted an extremely …
On the Kneser property for reaction–diffusion equations in some unbounded domains with an -valued non-autonomous forcing term
2012
Abstract In this paper, we prove the Kneser property for a reaction–diffusion equation on an unbounded domain satisfying the Poincare inequality with an external force taking values in the space H − 1 . Using this property of solutions we check also the connectedness of the associated global pullback attractor. We study also similar properties for systems of reaction–diffusion equations in which the domain is the whole R N . Finally, the results are applied to a generalized logistic equation.
A combinatorial view on string attractors
2021
Abstract The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word w = w 1 w 2 ⋯ w n is a subset Γ of the positions { 1 , … , n } , such that all distinct factors of w have an occurrence crossing at least one of the elements of Γ. In this paper we explore the notion of string attractor by focusing on its combinatorial properties. In particular, we show how the size of the smallest string attractor of a word varies when combinatorial operations are applied and we deduce that such a measure is not monotone. Moreover, we introduce a c…