CHAOTIFICATION OF DISCRETE-TIME DYNAMICAL SYSTEMS: AN EXTENSION OF THE CHEN–LAI ALGORITHM

2005 ◽  
Vol 15 (01) ◽  
pp. 109-117 ◽  
Author(s):  
DEJIAN LAI ◽  
GUANRONG CHEN

In this article, we propose and study an extension of the Chen–Lai algorithm for chaotification of discrete-time dynamical systems. The proposed method is a simple but mathematically rigorous feedback control design method that can gradually make all the Lyapunov exponents of the controlled system strictly positive for any given n-dimensional dynamical system that has a uniformly bounded Jacobian but otherwise could be originally nonchaotic or even asymptotically stable.

1996 ◽  
Vol 06 (07) ◽  
pp. 1341-1349 ◽  
Author(s):  
GUANRONG CHEN ◽  
DEJIAN LAI

A simple, yet mathematically rigorous feedback control design method is proposed in this paper, which can make all the Lyapunov exponents of the controlled system strictly positive, for any given n-dimensional dynamical system that could be originally nonchaotic or even asymptotically stable. The argument used is purely algebraic and the design procedure is completely schematic, with no approximations used throughout the derivation. This is a rigorous and convenient technique suggested as an attempt for anticontrol of chaotic dynamical systems, with explicit computational formulas derived for applications.


1998 ◽  
Vol 08 (07) ◽  
pp. 1585-1590 ◽  
Author(s):  
Guanrong Chen ◽  
Dejian Lai

In this paper, a simple feedback control design method earlier proposed by us for discrete-time dynamical systems is proved to be a mathematically rigorous approach for anticontrol of chaos, in the sense that any given discrete-time dynamical system can be made chaotic by the designed state-feedback controller along with the mod-operations.


1992 ◽  
Vol 12 (1) ◽  
pp. 153-183 ◽  
Author(s):  
Joel W. Robbin ◽  
Dietmar A. Salamon

AbstractLet be an attractor network for a dynamical system ft: M → M, indexed by the lower sets of a partially ordered set P. Our main theorem asserts the existence of a Lyapunov map ψ:M → K(P) which defines the attractor network. This result is used to prove the existence of connection matrices for discrete-time dynamical systems.


2007 ◽  
Vol 5 ◽  
pp. 195-200
Author(s):  
A.V. Zhiber ◽  
O.S. Kostrigina

In the paper it is shown that the two-dimensional dynamical system of equations is Darboux integrable if and only if its characteristic Lie algebra is finite-dimensional. The class of systems having a full set of fist and second order integrals is described.


2009 ◽  
Vol 19 (10) ◽  
pp. 3283-3309 ◽  
Author(s):  
ALFREDO MEDIO ◽  
MARINA PIREDDU ◽  
FABIO ZANOLIN

This article describes a method — called here "the method of Stretching Along the Paths" (SAP) — to prove the existence of chaotic sets in discrete-time dynamical systems. The method of SAP, although mathematically rigorous, is based on some elementary geometrical considerations and is relatively easy to apply to models arising in applications. The paper provides a description of the basic mathematical ideas behind the method, as well as three applications to economic models. Incidentally, the paper also discusses some questions concerning the definition of chaos and some problems arising from economic models in which the dynamics are defined only implicitly.


Sign in / Sign up

Export Citation Format

Share Document