Search

Discretization schemes such as Euler method and Runge–Kutta techniques are extensively used to find approximate solutions of Continuous-Time (CT) dynamical system. While the approximation is good for small discretization step sizes, as pointed out by Lorenz, when the step size increases, computational chaos and computational instability are frequently observed, the former phenomenon being a precursor to the latter. By computational instability, it is meant that there is a blow up of trajectories for the Discrete-Time (DT) system. Computational chaos instead means that for certain step sizes, the DT system displays chaos while the CT counterpart is not chaotic. This paper studies the dynamics of a class of second-order maps obtained via the discretization of a Memristor Murali–Lakshmanan–Chua Circuit (MMLCC). The discretization, which is based on the DT Flux–Charge Analysis Method (FCAM), guarantees that the first integrals of a CT-MMLCC are preserved exactly for the DT system. Hence the dynamics of DT-MMLCC evolves on invariant manifolds and it is characterized by the coexistence of infinitely many different attractors (extreme multistability). The paper uses analytic techniques introduced by Marotto, based on the concept of snapback repellers and transverse homoclinic orbits, to study the chaotic behaviors of the maps. Regions of the parameter space are singled out where there exist snapback repellers for DT-MMLCC, thus implying that the maps display chaos in the Marotto and in the Li–Yorke sense. Since the corresponding CT-MMLCC does not display chaos, the observed chaos of DT-MMLCC is genuinely a consequence of the discretization scheme used in the paper, i.e. it can be actually considered as computational chaos. It is also verified that computational chaos is a precursor to computational instability of the DT-MMLCC maps. Finally, the paper analyzes the effect on chaos obtained by changing the invariant manifold where the dynamics evolves. [ABSTRACT FROM AUTHOR]

The use of ideal memristors in a continuous-time (CT) nonlinear circuit is known to greatly enrich the dynamic behavior with respect to the memristorless counterpart, which is a crucial property for applications in future analog electronic circuits. This can be explained via the flux–charge analysis method (FCAM), according to which CT circuits with ideal memristors have for structural reasons first integrals (or invariants of motion, or conserved quantities) and their state space can be foliated in infinitely many invariant manifolds where they can display different dynamics. The paper introduces a new discretization scheme for the memristor which, differently from those adopted in the literature, guarantees that the first integrals of the CT memristor circuits are preserved exactly in the discretization, and that this is true for any step size. This new scheme makes it possible to extend FCAM to discrete-time (DT) memristor circuits and rigorously show the existence of invariant manifolds and infinitely many coexisting attractors (extreme multistability). Moreover, the paper addresses standard bifurcations varying the discretization step size and also bifurcations without parameters, i.e. bifurcations due to varying the initial conditions for fixed step size and circuit parameters. The method is illustrated by analyzing the dynamics and flip bifurcations with and without parameters in a DT memristor–capacitor circuit and the Poincaré–Andronov–Hopf bifurcation in a DT Murali–Lakshmanan–Chua circuit with a memristor. Simulations are also provided to illustrate bifurcations in a higher-order DT memristor Chua's circuit. The results in the paper show that DT memristor circuits obtained with the proposed discretization scheme are able to display even richer dynamics and bifurcations than their CT counterparts, due to the coexistence of infinitely many attractors and the possibility to use the discretization step as a parameter without destroying the foliation in invariant manifolds. [ABSTRACT FROM AUTHOR]

The article shows that transient chaos phenomena can be observed in a generalized memristor Chua's circuit where a nonlinear resistor is introduced to better model the real memristor behaviour. The flux‐charge analysis method is used to explain the origin of transient chaos, that is attributed to the drift of the index of the memristor circuit invariant manifolds caused by the charge flowing into the nonlinear resistor. [ABSTRACT FROM AUTHOR]

Since the introduction of memristors, it has been widely recognized that they can be successfully employed as synapses in neuromorphic circuits. This paper focuses on showing that memristor circuits can be also used for mimicking some features of the dynamics exhibited by neurons in response to an external stimulus. The proposed approach relies on exploiting multistability of memristor circuits, i.e., the coexistence of infinitely many attractors, and employing a suitable pulse-programmed input for switching among the different attractors. Specifically, it is first shown that a circuit composed of a resistor, an inductor, a capacitor and an ideal charge-controlled memristor displays infinitely many stable equilibrium points and limit cycles, each one pertaining to a planar invariant manifold. Moreover, each limit cycle is approximated via a first-order periodic approximation analytically obtained via the Describing Function (DF) method, a well-known technique in the Harmonic Balance (HB) context. Then, it is shown that the memristor charge is capable to mimic some simplified models of the neuron response when an external independent pulse-programmed current source is introduced in the circuit. The memristor charge behavior is generated via the concatenation of convergent and oscillatory behaviors which are obtained by switching between equilibrium points and limit cycles via a properly designed pulse timing of the current source. The design procedure takes also into account some relationships between the pulse features and the circuit parameters which are derived exploiting the analytic approximation of the limit cycles obtained via the DF method. [ABSTRACT FROM AUTHOR]

The paper proposes a novel input–output approach to characterize the dynamical properties of a class of circuits composed by a linear time-invariant two-terminal element coupled with one of the ideal memelements (memory elements) introduced by Prof. L. O. Chua, i.e. memristors, memcapacitors, and meminductors. The developed approach permits to readily determine the conditions under which the dynamics of any circuit of the class admits a first integral. It is also shown that the circuit dynamics can be obtained by collecting the dynamical behaviors displayed by a canonical reduced-order input–output system subject to a constant input of any amplitude. Notably, the reduced-order system exactly describes the dynamics of a circuit forced by a constant generator and with a nonlinear memoryless element in place of the memelement. The relation between the proposed input–output approach and the available state space ones (e.g. Flux-Charge Analysis Method (FCAM)) is also addressed. The main result is that explicit expressions of the invariant manifolds can be directly obtained in the voltage–current state space. Finally, it is shown how the approach also applies to circuits which contain forcing generators. It is believed that the proposed input–output approach can be a useful alternative to state space methods for studying multistability and control issues. [ABSTRACT FROM AUTHOR]