Chaotic behavior of discrete-time linear inclusion dynamical systems
Introduction
Chaos is not only an interesting but also an important subject in the theory of dynamical systems. It is well known that many nonlinear systems can exhibit “chaos” that is sensitive to initial conditions. Intuitively a small perturbation in initial conditions (such as those due to rounding errors in numerical computation) yields to widely diverging outcomes and to rendering long-term prediction impossible in general. Even if a dynamical system is deterministic, i.e., their future behavior is fully determined by their initial conditions with no random elements involved, the long-term prediction of its chaotic trajectories is still impossible.
Chaotic behavior of nonlinear or piecewise-linear deterministic systems has been extensively studied using mathematical theory since Li–Yorke [37]; see, e.g., [29]. Dynamical systems that exhibit chaos with certain control actions also are never new to the control community. For example, in [53], [54] it has been demonstrated that quantization can induce chaotic behavior in digital feedback control systems; in nonlinear/piecewise-linear and adaptive control settings, chaotic behavior has also been demonstrated via continuous nonlinear/piecewise-linear feedback control (cf., e.g., [2], [40], [46]). In many setups, identifying the presence of chaos can be a great advantage for feedback control design to stabilize those chaotic trajectories; see, for example, [1], [13], [43] and references therein.
There is no doubt about that inclusion/switched systems provide a convenient method for modeling a wide variety of complex dynamical systems. Unfortunately, while the modeling paradigm itself is quite straightforward, the analysis is highly nontrivial; this is because even simple inclusion/switched dynamical systems may exhibit very complex dynamics such as chaotic behavior. In [16], Chase et al. presented an example to illustrate how chaotic behavior can arise when switching between low-dimensional linear vector fields by choosing a piecewise-linear expanding map on an interval as the transition function of switching. In [39], for a continuous-time switched system that consists of two 3-dimensional inhomogeneous linear vector fields one of which is of the form and the other of which is of the form Liu et al. constructed a particular switching rule and gave a numerical simulation to illustrate the chaos near the contractive equilibrium . A similar construction also leads to chaotic behavior near the equilibrium 0 for continuous-time switched linear system with certain feedback controller as was shown in [57].
The above mentioned results are mainly based on the observation of numerical simulations. In current literature, sufficient condition that leads to chaos for linear inclusion/switched system as well as theoretical justification remain unsolved. These motivate us to study the following basic question for linear inclusion/switched systems without feedback controls, which was raised by Shorten et al. [48]:
Open problem ([48, Section 1(iv)]) Is it possible to determine if a inclusion/switched system can exhibit chaotic behavior for a given set of constituent linear subsystems?
For inclusion/switched dynamical systems, it is evident that the chaotic behaviors depend not only on the constituent subdynamics but also on the rule which orchestrates the switching.
In this paper, we shall borrow the idea of Li–Yorke chaos to give a mathematical definition of chaos for discrete-time linear inclusion dynamical system and then consider when such a system will exhibit the irregular/chaotic dynamical behavior. Our main results—Theorem 2.3, Theorem 2.4 and 2.5 in Section 2.2 solve the above Open problem of Shorten et al. [48].
The obtained results are useful for us to construct examples of discontinuity of Lyapunov exponents (cf. Remark 2.8 in Section 2.3). This is itself an interesting topic in ergodic theory.
Section snippets
Basic mathematical concepts
Throughout this paper, let be endowed with the discrete topology and let . Let be K real d-by-d matrices, where K ≥ 2 and d ≥ 1 are two integers. This then induces a discrete-time linear inclusion dynamical system described by which is important for modeling many control problems (cf. [38], [44], [48], [49]). Here x0 is called an initial state of this dynamical system. Since chaos also depends upon the choice of switching laws, we need to
Joint co-spectral radius and a reduction theorem
As was pointed out in Section 2.2, the fiberwise chaos implies that there exists at least one negative Lyapunov exponent for System (2.1) (cf. Theorem 6.2). To prove this, we need to introduce a concept—the joint co-spectral radius—and then prove an Elsner-type reduction theorem for System (2.1).
Let System (2.1) be based on the K real d-by-d nonsingular matrices throughout the sequel of this section.
Chaotic switching laws
This section will be devoted to comparing our definition of fiberwise chaotic switching law with the chaos of Balde and Jouan introduced in [3]. In addition, we shall introduce the Lyapunov exponents and study the fiberwise chaotic dynamics from a viewpoint of ergodic theory. Let not necessarily nonsingular, and then we still consider the induced linear inclusion system
Fiberwise chaotic dynamics
This section will be devoted to proving our main results Theorems 2.3 and 2.4 stated in Section 2.2. Recall that and consists of all possible switching laws .
Coexistence of ± and 0 Lyapunov exponents and periodic stability
In this section, we will prove some necessary conditions for the fiberwise chaos and show that every periodically stable system has no fiberwise chaotic dynamics.
Concluding remarks
In this paper, we have introduced the dynamical concept—fiberwise chaotic switching laws—for a discrete-time linear inclusion dynamical system/hybrid system that is induced by finitely many nonsingular square matrices.
We have proven that if the inclusion system has a stable word and meanwhile an expanding word, then its fiberwise chaotic switching laws form a residual subset of its all possible switching laws (Theorem 2.3). Therefore in this case, the “generic” dynamical behavior of this
Acknowledgments
This publication was made possible by NPRP grant 9-166-1-031 from the Qatar National Research Fund (a member of Qatar Foundation). The statements made herein are solely the responsibility of the authors. In addition Dai was also supported by National Natural Science Foundation of China (Grants Nos. 11431012 and 11271183) and PAPD of Jiangsu Higher Education Institutions; Huang was also supported partly by National Natural Science Foundation of China grant 11371380 and Xiao in part by NSF
References (57)
- et al.
Bounded semigroups of matrices
Linear Algebra Appl.
(1992) - et al.
On Li–Yorke pairs
J. Reine Angew. Math.
(2002) - et al.
The boundedness of all products of a pair of matrices is undecidable
Syst. Contr. Lett.
(2000) - et al.
A survey of computational complexity results in systems and control
Automatica J. IFAC.
(2000) - et al.
The control of chaos: theory and applications
Phys. Rep.
(2000) Inequalities for numerical invariants of sets of matrices
Linear Algebra Appl.
(2003)- et al.
Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture
J. Am. Math. Soc.
(2002) - et al.
Dynamics of tuples of matrices
Proc. Am. Math. Soc.
(2009) Hyperbolicity and integral expression of the Lyapunov exponents for linear cocycles
J. Differ. Equ.
(2007)Extremal and Barabanov semi-norms of a semigroup generated by a bounded family of matrices
J. Math. Anal. Appl.
(2011)