Numerical test for hyperbolicity of chaotic dynamics in time-delay systems

Numerical test for hyperbolicity of chaotic dynamics in time-delay systems

Pavel V. Kuptsov p.kuptsov@rambler.ru Institute of electronics and mechanical engineering, Yuri Gagarin State Technical University of Saratov, Politekhnicheskaya 77, Saratov 410054, Russia    Sergey P. Kuznetsov Institute of Mathematics, Information Technologies and Physics, Udmurt State University, Universitetskaya 1, Izhevsk 426034, Russia Kotel’nikov’s Institute of Radio-Engineering and Electronics of RAS, Saratov Branch, Zelenaya 38, Saratov 410019, Russia
July 25, 2019
Abstract

We develop a numerical test of hyperbolicity of chaotic dynamics in time-delay systems. The test is based on the angle criterion and includes computation of angle distributions between expanding, contracting and neutral manifolds of trajectories on the attractor. Three examples are tested. For two of them previously predicted hyperbolicity is confirmed. The third one provides an example of a time-delay system with nonhyperbolic chaos.

hyperbolic chaos, Lyapunov analysis, angle criterion, numerical test of hyperbolicity
pacs:
05.45.-a, 05.45.Jn, 02.30.Ks

Hyperbolic chaotic attractors, like the Smale-Williams solenoid and some other mathematical examples, manifest deterministic chaos justified in rigorous mathematical sense Smale (1967); Anosov (1995); Katok and Hasselblatt (1995). In such attractors all orbits in state space are of saddle type, and their expanding and contracting manifolds do not have tangencies but can only intersect transversally. These attractors demonstrate strong stochastic properties and allow a detailed mathematical analysis. They are rough, i.e., structurally stable. This means robustness with respect to variation of functions and parameters in the dynamical equations, and insensitivity of chaos characteristics to noises, interferences etc. In the theory of oscillations, since the classic work of Andronov and his school Andronov and Pontryagin (1937); Andronov et al. (1966), rough or structurally stable systems are regarded as those subjected to priority research, and as the most important for practice. It seems natural that the same should be true for systems with structurally stable uniformly hyperbolic attractors. However, until very recently, no physical examples were known. The hyperbolic attractors were commonly regarded as purified abstract mathematical images of chaos rather than something intrinsic to real world systems. In this situation a good way was to turn to a purposeful construction of systems with hyperbolic dynamics using a toolbox of physics (oscillators, particles, fields, interactions, feedback circuits, etc.) instead of that of mathematics (geometric, algebraic, topological constructions). In this regard, certain progress has been achieved recently, and many realizable physically motivated systems with hyperbolic attractors have been offered Kuznetsov (2012, 2011).

Naturally, physical and technical devices we deal with are not well suited to allow mathematical proofs although confident confirmation of hyperbolicity is significant to exploit properly the relevant results of mathematical theory. So it is vital to employ numerical instruments for computational tests of hyperbolicity.

In this respect one has to mention first the so-called cone criterion based on a mathematical theorem adapted to computer verification that has been applied for some low-dimensional systems Kuznetsov and Sataev (2007); Kuznetsov et al. (2010); Wilczak (2010).

The second approach is based on the verification of transversality of stable and unstable manifolds for orbits belonging to the attractor, or more generally, to an invariant set of interest. It involves an inspection of statistical distributions of the angles between the manifolds. If hyperbolicity holds, all the observed angles have to be distant from zero. This method was suggested initially in Ref. Lai et al. (1993) and then developed and used with modifications in Hirata et al. (1999); Anishchenko et al. (2000); Kuznetsov (2005); Kuznetsov and Seleznev (2006); Ginelli et al. (2007); Wolfe and Samelson (2007); Kuptsov and Kuznetsov (2009); Kuptsov (2012); Kuptsov and Parlitz (2012); Kuznetsov (2015); Kuznetsov and Kruglov (2016). It may be regarded as an extended version of Lyapunov analyses, well-established and applied successively not only for low-dimensional systems but for spatiotemporal systems too.

An important class among nonlinear systems with complex dynamics is formed by systems containing time-delay feedback loops. Such examples are wide-spread in electronics, laser physics, acoustics and other fields Vyhlídal et al. (2013). An adequate mathematical description for these objects is based on differential equations with delays Bellman and Cooke (1963); Myshkis (1972); El’sgol’ts and Norkin (1973). These dynamical systems have to be treated as possessing infinite-dimensional state space since a continuum of data, i.e, a trajectory segment, determines each new infinitesimal time step. A number of time-delay systems with chaotic dynamics was explored Dorizzi et al. (1987); Chrostowski et al. (1983); Lepri et al. (1994); Mackey and Glass (1977); Farmer (1982); Grassberger and Procaccia (1984); Kuznetsov and Ponomarenko (2008); Kuznetsov and Pikovsky (2010, 2008); Baranov et al. (2010); Kuznetsov and Kuznetsov (2013). Several examples of them were suggested as realizable devices for generation of rough hyperbolic chaos Kuznetsov and Ponomarenko (2008); Kuznetsov and Pikovsky (2010, 2008); Baranov et al. (2010); Kuznetsov and Kuznetsov (2013). However, no computer verification of hyperbolicity was provided for these systems as no appropriate methods were elaborated for this special class of infinite-dimensional dynamics.

In the present paper we extend the angle criterion to make it applicable for time-delay systems with one constant retarding time.

To start with, let us recall the content of the angle criterion for finite-dimensional systems following Refs. Kuptsov (2012); Kuptsov and Parlitz (2012). For a system defined by a set of ordinary differential equations the corresponding variational equation for infinitesimal perturbations near the reference orbit reads

(1)

where are the state vector and the perturbation vector, respectively, and is the Jacobi matrix. The notation presumes the dependence of this matrix both on and . If the dependence of and, consequently, of on is explicit, the system is nonautonomous. (In this case we always restrict ourselves to considering equations with periodic dependencies of coefficients on .)

Assume that we deal with an invariant set (attractor) possessing positive, one zero, and negative Lyapunov exponents. To compute the angles between expanding, neutral, and contracting tangent subspaces we first need to run the standard algorithm for computing Lyapunov exponents Benettin et al. (1980); Shimada and Nagashima (1979). The main system is solved simultaneously with copies of the variational equation (1). Periodically perturbation vectors produced by the variational equations are orthogonalized and normalized. In matrix notation it corresponds to the so-called QR decomposition Golub and Van Loan (2012) of a matrix whose columns are the perturbation vectors . This procedure represents the matrix as a product of an orthogonal matrix and an upper triangle matrix . Often this is implemented via the Gram-Schmidt algorithm Golub and Van Loan (2012). The columns of are used in further computations as new perturbation vectors. After excluding transient iterations, they converge to the so-called backward Lyapunov vectors Kuptsov and Parlitz (2012) (they are called “backward” since arrive at after initialization in the far past; notice also that the convergence does not imply the time constancy of these vectors). Computing Lyapunov exponents, one accumulates logarithms of the diagonal elements of , but in the framework of the angle criterion one has to store the backward Lyapunov vectors instead. The time interval between successive QR decompositions can be chosen arbitrarily, but it must be not too large to avoid an overflow of computer digital registers. The backward Lyapunov vectors are stored for a discrete set of points where the angles will be computed later.

The next stage of the routine consists in the passage along the same reference orbit backward in time applying the similar Lyapunov algorithm but for vectors generated now by the adjoint variational equation

(2)

Here is the adjoint matrix for , such that the inner products involving arbitrary vectors and satisfy the identity . If the inner product is defined as , then we have simply , where “T” stands for transposition. The orthogonal matrices obtained from the QR procedure in the course of the computations with the adjoint equation (2) in backward time converge to the so-called forward Lyapunov vectors Kuptsov and Parlitz (2012).

Now we use the stored forward and backward Lyapunov vectors relating to the identical trajectory points. Information about the angles is encoded in a matrix of their pairwise inner products. The smallest singular value of its top left submatrix is the tangency indicator: is the angle between the expanding subspace and the sum of the neutral and contracting ones, and is the angle between the expanding plus neutral subspace and the contracting one Kuptsov (2012).

One can easily check that for arbitrary solutions to Eqs. (1) and (2) the inner product remains constant in time, i.e., satisfies the identity

(3)

In particular, in the case of nonzero inner product, if one of the solutions is characterized by a Lyapunov exponent so that , then the other one has a Lyapunov exponent with the opposite sign, . Hence the Lyapunov spectra corresponding to equations (1) and (2) are identical up to the signs.

Given only one of Eqs. (1) and (2), one can use (3) to find the other one. This idea can be employed to recover a generic form of the adjoint variational equation for time delay systems.

Consider a time-delay system

(4)

where , , and is the delay time. The corresponding variational equation reads

(5)

where and are the derivative matrices composed of partial derivatives of over components of and , respectively.

As a preliminary step to guess a proper form for the adjoint variational equation we rewrite Eq. (5) as an equation for a system containing explicitly a delay line, where a signal propagation is characterized by the time :

(6)
(7)
(8)

Here is the delay line variable, is the length of the delay line, and the subscripts and stand for corresponding partial derivatives. The solution to Eq. (7) is a wave (8) propagating in the positive direction from a source at . Substituting it into (6) yields the original equation (5).

In view of this recasting the variational equation, it is natural to define the inner product of two perturbation vectors and as

(9)

The arbitrary solution of desired adjoint variational equations and satisfying Eqs. (6)-(8) have to fulfill a condition analogous to (3), i.e., , with respect to the inner product (9). This requirement results in the following form of the adjoint variational equations:

(10)
(11)
(12)

(One can check directly that the identity is fulfilled taking into account the equality .) Observe that, in contrast to Eq. (7) containing a source, we introduce a kind of sink in (11); in other words, we exploit here an advanced wave solution of equation (11) instead of the usual retarding wave solution.

Substituting Eq. (12) into (10), one can reformulate the adjoint variational problem as a differential equation with deviating argument:

(13)

The theory of differential equations with deviating arguments distinguishes three main cases: equations with a retarded argument (like Eqs. (4) and (5)), equations of neutral type (we do not deal with them here), and equations of leading or advanced type (like Eq. (13)) Bellman and Cooke (1963); Myshkis (1972); El’sgol’ts and Norkin (1973). The latter are regarded as poorly defined with respect to the existence of solutions to initial value problems. In the context of our study, however, we will solve such equations in backward time only, so that they behave in a good way like the equations of retarded type in forward time.

Notice that computing the inner products (9) of vectors obtained as trajectory segments of time duration produced by Eqs. (5) and (13), one needs to reverse the order of the adjoint trajectory variables: for Eq. (5) we set , but for (13) .

We will solve both Eq. (4) and the variational equation (5) numerically with Heun’s method that belongs to the class of second-order Runge-Kutta methods with constant time step Bellen and Zennaro (2013). The full state vector of the discrete time approximation of Eq. (5) includes elements , where we assume to be an integer, and is a time step. Numerical integration of this linear equation implies successive multiplications of the state vector by a numerical Jacobi matrix composed of elements. Regardless of , only a small number of the matrix elements are nontrivial; most of them are merely zeros and ones. In particular, for the Heun method this matrix has nontrivial elements. In the course of the forward time stage of the angle computation algorithm one can store these matrix elements without the risk of exhausting a computer memory. Then, the backward time stage can be implemented without explicitly solving Eq. (13). One just computes adjoint matrices from the stored matrix elements and performs the iterations with them.

Computed in this way, the perturbation vectors converge as to solutions of Eqs. (5) and (13) if the adjoint numerical Jacobi matrix is defined as

(14)

where and is a metric tensor generated by a discrete version of the inner product (9);

(15)

Here , and if corresponds to an adjoint vector, the elements of the backward in time solution have to be taken in the reverse order: .

Orthonormalization routines employed in the angle computations have to be re-implemented according to the nonstandard form of the inner product (15). When exploiting linear algebra libraries, a simpler alternative is to change the basis for the perturbation vectors setting with respective transformation of the Jacobi matrix

(16)

One can see that , and is equivalent to . In other words, the transformed Jacobi matrix and the corresponding vectors are written in orthonormal basis whose metric tensor is the identity. Altogether, computing the Jacobi matrices along a forward time trajectory we first transform them according to Eq. (16) and then perform the angle computation algorithm implementing standard orthonormalization routines without the need to redefine the inner product.

Now we are ready to apply the angle criterion to particular time-delay systems.

The first is a nonautonomous system based on the van der Pol oscillator of natural frequency supplied with a specially designed time-delay feedback Kuznetsov and Ponomarenko (2008):

(17)

The parameter controlling the oscillator excitation is modulated with period and amplitude . Accordingly, the oscillator alternately manifests activation and damping. If the retarding time is properly tuned, say , the emergence of self-oscillations at each next stage of activity is stimulated by a signal emitted at the previous activity stage. Since the delayed signal is squared and mixed with auxiliary oscillations of frequency , the stimulating force has again frequency , but the doubled phase in comparison with the original oscillations. As a result, we get a sequence of oscillation trains with phases at successive excitation stages obeying the doubly-expanding circle map that is a chaotic Bernoulli-type map

(18)

According to argumentation in Ref. Kuznetsov and Ponomarenko (2008), this means that the attractor for a Poincaré map, which corresponds to states obtained stroboscopically at , is of Smale-Williams type, and the respective chaotic dynamics is hyperbolic. (In fact, the system (17) has an additional attracting fixed point , but its basin of attraction is very narrow. Arbitrarily chosen initial conditions of relatively large amplitude provide an approach of orbits to the Smale-Williams attractor.)

Figure 1: (color online) Distributions of for system (17) at different time steps , see the legend. , , , , . The first four Lyapunov exponents are ,,, .
Figure 2: (color online) The minimum cutoff angle against (a) and (b) . (a) . Curve 1: , ; 2: , ; 3: , . (b) Curve 1: , , ; 2: , , ; 3: , , . For both panels .

The system (17) has a single positive Lyapunov exponent and the others are negative. (Zero Lyapunov exponent is absent because of the nonautonomous nature of the system.) Thus, we need to implement the angle computation routine with .

Figure 1 shows histograms of the angle distributions computed for numerical solutions of the equations with different time steps . The angles are obtained for the corresponding stroboscopic map at , where is large enough to exclude transients, and . Regardless of (being sufficiently small) the distributions have a well reproducible form that supports the correctness of our definitions in the continual limit. The form of the histograms certainly confirms the hyperbolicity of chaotic dynamics in the system. Indeed, the distribution is well separated from zero angles.

Figure 2 shows the dependencies of the minimum cut-off angle against the system parameters to verify robustness of the hyperbolic chaos. In its panels (a) and (b) and are varied, respectively, for three arbitrarily chosen sets of parameters. Observe that the angle distributions remain well separated from the origin in a wide parameter domain. (The spikes on the curves in panel (a), e.g., at etc., correspond to situations when the angle distributions are maximally distant from zero, although it is not easy to explain the origin of the phenomenon clearly.) In the left part of the plot (a) relating to the case one can see a narrow domain where the minimal angles are close to zero, and the dynamics becomes nonhyperbolic. In panel (b) an extensive domain of hyperbolicity in the middle part shows that the fine tuning of at given is actually not necessary because the hyperbolicity persists in a relatively wide range.

The second system we consider is an autonomous model with an attractor of Smale-Williams type suggested in Ref. Kuznetsov and Pikovsky (2010), see also Kuznetsov (2012); Arzhanukhina and Kuznetsov (2014):

(19)

Here is an excitation parameter and can be treated as a natural frequency. When , this system generates trains of oscillations of frequency periodically alternating with damping stages of very low amplitude. Due to the term providing a delayed feedback controlled by the small parameter , each new train of oscillations arises from a seed signal produced by the system at the previous excitation stage. Because of the quadratic nonlinearity of the respective term, each time the phase is doubled in comparison with the previous one. As a result, the phases at successive excitation stages evolve according to the Bernoulli-type map (18), and, as argued in Ref. Kuznetsov and Pikovsky (2010), this means that the Poincaré map constructed for the system (19) has an attractor of Smale-Williams type. Following Kuznetsov and Pikovsky (2010), we will consider the Poincaré map on the surface taking into account the passages of phase trajectories in the direction of increasing amplitude and computing the angles between subspaces there.

Figure 3: (color online) Distributions of the first (a) and second (b) angles for the Poincaré map of the autonomous system (19) computed at different time steps, see the legend. , , , . The first four Lyapunov exponents are , , , .
Figure 4: (color online) First and second minimum cutoff angles vs. delay time at various parameters: (a) , ; (b) , ; (c) , . For all panels .

Autonomous system (19) has a single positive Lyapunov exponent, a zero one, and the other exponents are negative. The zero Lyapunov exponent and the corresponding neutral subspace vanish for the Poincaré map, so that one can consider only the angles between the expanding and contracting subspaces as above. However, implementing this approach, one needs to project the computed perturbation vectors onto the section surface and then evaluate the angles between these projections. A simpler way is to consider perturbation vectors as they appear in computations in full phase space and to check both the angles (the expanding subspace vs. the sum of neutral and contracting subspaces) and (the expanding plus neutral subspace vs. the contracting subspace). Chaos is hyperbolic when both of these angles never vanish.

Figure 3 shows histograms of the distributions of these angles obtained for certain parameters of the system (see the caption) at different values of the integration step . We see a good convergence as both for and for (panels (a) and (b), respectively). Both distributions are well separated from the zero angle having clearly expressed cutoffs that confirms hyperbolicity of the attractor. The robustness of this regime is illustrated in Fig. 4(a-c), which represents the dependence of the minimum cutoff angles and versus the parameter of time delay for three sets of other parameters. On all three plots well-defined ranges occur corresponding to domains of existence of the hyperbolic attractor where both angles are well detached from zero.

The last example we present is aimed to outline the difference between the hyperbolic and nonhyperbolic chaos. It is the well-known Mackey-Glass system Mackey and Glass (1977); Farmer (1982); Grassberger and Procaccia (1984)

(20)

where and . When , chaotic oscillations occur in the system Farmer (1982); Grassberger and Procaccia (1984).

To perform an adequate comparison with the previous cases, we have to introduce for this system an appropriate Poincaré section providing well-expressed separation of the successive crossings by phase trajectories. A good and satisfactory expedient is based on complementing the model (20) with an auxiliary equation and locating the section surface at . The variable roughly follows but smoothes out its high-frequency fluctuations.

Figure 5: (color online) Distribution of for system (20) at different time steps, see the legend. . The first four Lyapunov exponents are , , , .

Figure 5 shows histograms for the angle between the expanding subspace and the sum of neutral and contracting subspaces for the attractor observed at . The attractor has one positive, one zero, and other negative Lyapunov exponents. Observe the clearly expressed violation of hyperbolicity: the distributions demonstrate a significant probability of angles close to zero, which implies occurrence of tangencies for the subspaces. It is a sufficient condition to judge about the absence of hyperbolicity, so that there is no need to analyze a distribution for .

To conclude, we have developed the method of hyperbolicity verification based on the angle criterion for time-delay systems, which may be regarded as an extension of numerical Lyapunov analysis. Three particular examples have been tested. For two of them the previously believed hyperbolicity has been confirmed and for the third one the nonhyperbolic nature of the generated chaos has been established. We have restricted ourselves here to considering systems with one delay time. Extension for two or more delays requires further elaboration of the algorithm.

As regards the theoretical foundation and general formulation of the method, the work was supported by RSF grant No 15-12-20035 (SPK). The work of elaborating computer routines and numerical computations for particular examples was supported by RFBR grant No 16-02-00135 (PVK).

References

  • Smale (1967) S. Smale, “Differentiable dynamical systems,” Bull. Amer. Math. Soc. (NS) 73, 747–817 (1967).
  • Anosov (1995) D. V. Anosov, ed., Dynamical Systems 9: Dynamical Systems with Hyperbolic Behaviour, Encyclopaedia Math. Sci., Vol. 9 (Berlin: Springer, 1995).
  • Katok and Hasselblatt (1995) A. Katok and B. Hasselblatt, Introduction to the Modern Theory of Dynamical Systems, 1st ed., Encyclopedia of mathematics and its applications, Vol. 54 (Cambridge University Press, 1995) p. 802.
  • Andronov and Pontryagin (1937) A. A. Andronov and L. S. Pontryagin, “Structurally stable systems,” in Dokl. Akad. Nauk SSSR, Vol. 14 (1937) pp. 247–250.
  • Andronov et al. (1966) A. A. Andronov, S. E. Khaikin,  and A. A. Vitt, Theory of Oscillators (Pergamon Press, 1966).
  • Kuznetsov (2012) S. P. Kuznetsov, Hyperbolic Chaos: A Physicist’s View (Higher Education Press: Bijing and Springer-Verlag: Berlin, Heidelberg, 2012) p. 336.
  • Kuznetsov (2011) S. P. Kuznetsov, “Dynamical chaos and uniformly hyperbolic attractors: From mathematics to physics,” Phys. Uspekhi. 54, 119–144 (2011).
  • Kuznetsov and Sataev (2007) S. P. Kuznetsov and I. R. Sataev, “Hyperbolic attractor in a system of coupled non-autonomous van der pol oscillators: Numerical test for expanding and contracting cones,” Phys. Lett. A 365, 97–104 (2007).
  • Kuznetsov et al. (2010) A. S. Kuznetsov, S. P. Kuznetsov,  and I. R. Sataev, “Parametric generator of hyperbolic chaos based on two coupled oscillators with nonlinear dissipation,” Tech. Phys. 55, 1707–1715 (2010).
  • Wilczak (2010) D. Wilczak, “Uniformly hyperbolic attractor of the Smale–Williams type for a Poincaré map in the Kuznetsov system,” SIAM J. Applied Dynamical Systems 9, 1263–1283 (2010).
  • Lai et al. (1993) Y.-C. Lai, C. Grebogi, J. A. Yorke,  and I. Kan, “How often are chaotic saddles nonhyperbolic?” Nonlinearity 6, 779–798 (1993).
  • Hirata et al. (1999) Y. Hirata, K. Nozaki,  and T. Konishi, “The intersection angles between N-dimensional stable and unstable manifolds in 2N-dimensional symplectic mappings,” Prog. Theor. Phys. 102, 701–706 (1999).
  • Anishchenko et al. (2000) V. S. Anishchenko, A. S. Kopeikin, J. Kurths, T. E. Vadivasova,  and G. I. Strelkova, “Studying hyperbolicity in chaotic systems,” Phys. Lett. A 270, 301–307 (2000).
  • Kuznetsov (2005) S. P. Kuznetsov, “Example of a physical system with a hyperbolic attractor of the smale-williams type,” Phys. Rev. Lett. 95, 144101 (2005).
  • Kuznetsov and Seleznev (2006) S. P. Kuznetsov and E. P. Seleznev, “A strange attractor of the smale–williams type in the chaotic dynamics of a physical system,” JETP 102, 355–364 (2006).
  • Ginelli et al. (2007) F. Ginelli, P. Poggi, A. Turchi, H. Chaté, R. Livi,  and A. Politi, “Characterizing dynamics with covariant lyapunov vectors,” Phys. Rev. Lett. 99, 130601 (2007).
  • Wolfe and Samelson (2007) C. L. Wolfe and R. M. Samelson, “An efficient method for recovering Lyapunov vectors from singular vectors,” Tellus A 59, 355–366 (2007).
  • Kuptsov and Kuznetsov (2009) P. V. Kuptsov and S. P. Kuznetsov, “Violation of hyperbolicity in a diffusive medium with local hyperbolic attractor,” Phys. Rev. E 80, 016205 (2009).
  • Kuptsov (2012) P. V. Kuptsov, “Fast numerical test of hyperbolic chaos,” Phys. Rev. E 85, 015203 (2012).
  • Kuptsov and Parlitz (2012) P. V. Kuptsov and U. Parlitz, “Theory and computation of covariant Lyapunov vectors,” J. Nonlinear. Sci. 22, 727–762 (2012).
  • Kuznetsov (2015) S. P. Kuznetsov, “Hyperbolic chaos in self-oscillating systems based on mechanical triple linkage: Testing absence of tangencies of stable and unstable manifolds for phase trajectories,” Regular and Chaotic Dynamics 20, 649–666 (2015).
  • Kuznetsov and Kruglov (2016) S. P. Kuznetsov and V. P. Kruglov, “Verification of hyperbolicity for attractors of some mechanical systems with chaotic dynamics,” Regular and Chaotic Dynamics 21, 160–174 (2016).
  • Vyhlídal et al. (2013) T. Vyhlídal, J. F. Lafay,  and R. Sipahi, eds., Delay Systems: From Theory to Numerics and Applications, Vol. 1 (Springer Science & Business Media, 2013).
  • Bellman and Cooke (1963) R. Bellman and C.L. Cooke, Differential-difference equations (Acad. Press, 1963).
  • Myshkis (1972) A.D. Myshkis, Linear differential equations with retarded argument (Moscow, Nauka, 1972) p. 352, in Russian.
  • El’sgol’ts and Norkin (1973) L.E. El’sgol’ts and S.B. Norkin, Introduction to the theory and application of differential equations with deviating arguments (Acad. Press, 1973) p. 356.
  • Dorizzi et al. (1987) B. Dorizzi, B. Grammaticos, M. LeBerre, Y. Pomeau, E. Ressayre,  and A. Tallet, “Statistics and dimension of chaos in differential delay systems,” Phys. Rev. A 35, 328–339 (1987).
  • Chrostowski et al. (1983) J. Chrostowski, R. Vallee,  and C. Delisle, “Self-pulsing and chaos in acoustooptic bistability,” Can. J. Phys. 61, 1143–1148 (1983).
  • Lepri et al. (1994) S. Lepri, G. Giacomelli, A. Politi,  and F. T. Arecchi, “High-dimensional chaos in delayed dynamical systems,” Phys. D 70, 235–249 (1994).
  • Mackey and Glass (1977) MC Mackey and L Glass, “Oscillation and chaos in physiological control systems,” Science 197, 287–289 (1977).
  • Farmer (1982) J. D. Farmer, “Chaotic attractors of an infinite-dimensional dynamical system,” Phys. D 4, 366–393 (1982).
  • Grassberger and Procaccia (1984) P. Grassberger and I. Procaccia, “Dimensions and entropies of strange attractors from a fluctuating dynamics approach,” Phys. D 13, 34–54 (1984).
  • Kuznetsov and Ponomarenko (2008) S. P. Kuznetsov and V. I. Ponomarenko, ‘‘Realization of a strange attractor of the Smale-Williams type in a radiotechnical delay-feedback oscillator,” Tech. Phys. Lett. 34, 771–773 (2008).
  • Kuznetsov and Pikovsky (2010) S. P. Kuznetsov and A. Pikovsky, “Attractor of Smale-Williams type in an autonomous time-delay system,” Preprint nlin. arXiv: 1011.5972  (2010).
  • Kuznetsov and Pikovsky (2008) S. P. Kuznetsov and A. Pikovsky, “Hyperbolic chaos in the phase dynamics of a q-switched oscillator with delayed nonlinear feedbacks,” Europhys. Lett. 84 (2008).
  • Baranov et al. (2010) S. V. Baranov, S. P. Kuznetsov,  and V. I. Ponomarenko, “Chaos in the phase dynamics of q-switched van der pol oscillator with additional delayed-feedback loop,” Izvestiya VUZ. Applied Nonlinear Dynamics (Saratov) 18, 11–23 (2010), in Russian.
  • Kuznetsov and Kuznetsov (2013) A. S. Kuznetsov and S. P. Kuznetsov, “Parametric generation of robust chaos with time-delayed feedback and modulated pump source,” Commun. Nonlinear Sci. Numer. Simul. 18, 728–734 (2013).
  • Benettin et al. (1980) Giancarlo Benettin, Luigi Galgani, Antonio Giorgilli,  and Jean-Marie Strelcyn, “Lyapunov characteristic exponents for smooth dynamical systems and for hamiltonian systems: a method for computing all of them. Part 1: Theory,” Meccanica 15, 9–20 (1980).
  • Shimada and Nagashima (1979) Ippei Shimada and Tomomasa Nagashima, “A numerical approach to ergodic problem of dissipative dynamical systems,” Prog. Theor. Phys. 61, 1605–1616 (1979).
  • Golub and Van Loan (2012) Gene H Golub and Charles F Van Loan, Matrix computations, Vol. 3 (JHU Press, 2012).
  • Bellen and Zennaro (2013) Alfredo Bellen and Marino Zennaro, Numerical methods for delay differential equations (Oxford university press, 2013) p. 410.
  • Arzhanukhina and Kuznetsov (2014) D. S. Arzhanukhina and S. P. Kuznetsov, “Robust chaos in autonomous time-delay system,” Izvestiya VUZ. Applied Nonlinear Dynamics (Saratov) 22, 36–49 (2014).
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
213209
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description