On Symbolic Computation of the LCE of N-Dimensional Dynamical Systems

Author(s):  
Shucheng Ning ◽  
Zhiming Zheng
Author(s):  
W. Grant Kirkland ◽  
S. C. Sinha

Many dynamical systems can be modeled by a set of linear/nonlinear ordinary differential equations with periodic time-varying coefficients. The state transition matrix Φ(t,α) associated with the linear part of the equation can be expressed in terms of the periodic Lyapunov-Floquét transformation matrix Q(t,α) and a time-invariant matrix R(α). Computation of Q(t,α) and R(α) in a symbolic form as a function of system parameters α is of paramount importance in stability, bifurcation analysis, and control system design. In the past, a methodology has been presented for computing Φ(t,α) in a symbolic form, however Q(t,α) and R(α) have never been calculated in a symbolic form. Since Q(t,α) and R(α) were available only in numerical forms, general results for parameter unfolding and control system design could not be obtained in the entire parameter space. In this work a technique for symbolic computation of Q(t,α), and R(α) matrices is presented. First, Φ(t,α) is computed symbolically using the shifted Chebyshev polynomials and Picard iteration method as suggested in the literature. Then R(α) is computed using the Gaussian quadrature integral formula. Finally Q(t,α) is computed using the matrix exponential summation method. Using Mathematica, this approach has successfully been applied to the well-known Mathieu equation and a four dimensional time-periodic system in order to demonstrate the applications of the proposed method to linear as well as nonlinear problems.


2019 ◽  
Vol 29 (04) ◽  
pp. 1950054 ◽  
Author(s):  
Bo Huang ◽  
Wei Niu

This paper presents an algebraic criterion for determining whether all the zeros of a given polynomial are outside the unit circle in the complex plane. This criterion is used to deduce critical algebraic conditions for the occurrence of chaos in multidimensional discrete dynamical systems based on a modified Marotto’s theorem developed by Li and Chen (called “Marotto–Li–Chen theorem”). Using these algebraic conditions we reduce the problem of analyzing chaos induced by snapback repeller to an algebraic problem, and propose an algorithmic approach to solve this algebraic problem by means of symbolic computation. The proposed approach is effective as shown by several examples and can be used to determine the possibility that all the fixed points are snapback repellers.


2007 ◽  
Vol 44 (4) ◽  
pp. 289-306
Author(s):  
Ubirajara F. Moreno ◽  
Pedro L. D. Peres ◽  
Ivanil S. Bonatti

The aim of this paper is to introduce a few topics about nonlinear systems that are usual in electrical engineering but are frequently disregarded in undergraduate courses. More precisely, the main subject of this paper is to present the analysis of bifurcations in dynamical systems through the use of symbolic computation. The necessary conditions for the occurrence of Hopf, saddle-node, transcritical or pitchfork bifurcations in first order state space nonlinear equations depending upon a vector of parameters are expressed in terms of symbolic computation. With symbolic computation, the relationship between the state variables and the parameters that play a crucial role in the occurrence of such phenomena can be established. Firstly, the symbolic computation is applied to a third order dynamic Lorenz system in order to familiarise the students with the technique. Then, the symbolic routines are used in the analysis of the simplified model of a power system, bringing new insights and a deeper understanding about the occurrence of these phenomena in physical systems.


Sign in / Sign up

Export Citation Format

Share Document