• Title/Summary/Keyword: Discrete dynamical systems

Search Result 39, Processing Time 0.02 seconds

MULTIPLE VALUED ITERATIVE DYNAMICS MODELS OF NONLINEAR DISCRETE-TIME CONTROL DYNAMICAL SYSTEMS WITH DISTURBANCE

  • Kahng, Byungik
    • Journal of the Korean Mathematical Society
    • /
    • v.50 no.1
    • /
    • pp.17-39
    • /
    • 2013
  • The study of nonlinear discrete-time control dynamical systems with disturbance is an important topic in control theory. In this paper, we concentrate our efforts to multiple valued iterative dynamical systems, which model the nonlinear discrete-time control dynamical systems with disturbance. After establishing the validity of such modeling, we study the invariant set theory of the multiple valued iterative dynamical systems, including the controllability/reachablity problems of the maximal invariant sets.

ON ω-LIMIT SETS AND ATTRACTION OF NON-AUTONOMOUS DISCRETE DYNAMICAL SYSTEMS

  • Liu, Lei;Chen, Bin
    • Journal of the Korean Mathematical Society
    • /
    • v.49 no.4
    • /
    • pp.703-713
    • /
    • 2012
  • In this paper we study ${\omega}$-limit sets and attraction of non-autonomous discrete dynamical systems. We introduce some basic concepts such as ${\omega}$-limit set and attraction for non-autonomous discrete system. We study fundamental properties of ${\omega}$-limit sets and discuss the relationship between ${\omega}$-limit sets and attraction for non-autonomous discrete dynamical systems.

CONSTRUCTIVE AND DISCRETE VERSIONS OF THE LYAPUNOV′S STABILITY THEOREM AND THE LASALLE′S INVARIANCE THEOREM

  • Lee, Jae-Wook
    • Communications of the Korean Mathematical Society
    • /
    • v.17 no.1
    • /
    • pp.155-163
    • /
    • 2002
  • The purpose of this paper is to establish discrete versions of the well-known Lyapunov's stability theorem and LaSalle's invariance theorem for a non-autonomous discrete dynamical system. Our proofs for these theorems are constructive in the sense that they are made by explicitly building a Lyapunov function for the system. A comparison between non-autonomous discrete dynamical systems and continuous dynamical systems is conducted.

EULER METHOD VS. GESS METHOD FOR DYNAMICAL SYSTEMS

  • DONG WON YU
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.2
    • /
    • pp.397-406
    • /
    • 1997
  • In this paper we introduce GESS method and show that dynamics of the system y'=A(s,t,y) y is more faithfully approxi-mated by GESS method that by Euler method. Numerical experiments are given for the comparison of GESS method with Euler method.

Generalized runge-kutta methods for dynamical systems

  • Yu, Dong-Won
    • Bulletin of the Korean Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.157-172
    • /
    • 1998
  • A numerical method is proposed for dynamical systems. We utilize the fact that special matrix exponentials can be exactly evaluated by the intrinsic library functions. Numerical examples are given, which show that the relative error s of the proposed method converge to a small constant and that the method faithfully approximates the dynamics of the nonlinear differential equations.

  • PDF

EXTENDING THE APPLICATION OF THE SHADOWING LEMMA FOR OPERATORS WITH CHAOTIC BEHAVIOUR

  • Argyros, Ioannis K.
    • East Asian mathematical journal
    • /
    • v.27 no.5
    • /
    • pp.521-525
    • /
    • 2011
  • We use a weaker version of the celebrated Newton-Kantorovich theorem [3] reported by us in [1] to find solutions of discrete dynamical systems involving operators with chaotic behavior. Our results are obtained by extending the application of the shadowing lemma [4], and are given under the same computational cost as before [4]-[6].

Identification of nonlinear dynamical systems based on self-organized distributed networks (자율분산 신경망을 이용한 비선형 동적 시스템 식별)

  • 최종수;김형석;김성중;권오신;김종만
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.45 no.4
    • /
    • pp.574-581
    • /
    • 1996
  • The neural network approach has been shown to be a general scheme for nonlinear dynamical system identification. Unfortunately the error surface of a Multilayer Neural Networks(MNN) that widely used is often highly complex. This is a disadvantage and potential traps may exist in the identification procedure. The objective of this paper is to identify a nonlinear dynamical systems based on Self-Organized Distributed Networks (SODN). The learning with the SODN is fast and precise. Such properties are caused from the local learning mechanism. Each local network learns only data in a subregion. This paper also discusses neural network as identifier of nonlinear dynamical systems. The structure of nonlinear system identification employs series-parallel model. The identification procedure is based on a discrete-time formulation. Through extensive simulation, SODN is shown to be effective for identification of nonlinear dynamical systems. (author). 13 refs., 7 figs., 2 tabs.

  • PDF

THE E-EULER PROCESS FOR NONAUTONOMOUS SYSTEMS

  • Yu, Dong-Won
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.8 no.2
    • /
    • pp.87-93
    • /
    • 2004
  • The E-Euler process has been proposed for autonomous dynamical systems in [7]. In this paper, the E-Euler process is extended to nonautonomous dynamical systems. When a discrete function is bounded or gradually decreases to ${\epsilon}\;<<\;1$ as $n\;{\rightarrow}\;{\infty}$, it is shown that the relative error converges to a constant or decreases.

  • PDF

Stability Analysis of Large Scale Dynamical Systems Using Computer Generated Lyapunov Functions (컴퓨터 발생 Lyapunov 함수에 의한 대규모 시스템의 안정도 해석)

  • Nam, Boo-Hee
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.1
    • /
    • pp.46-51
    • /
    • 1987
  • Using the computer-generated Lyapunov functions due to Brayton-tong's constructive algorithm, we estimate the domains of attraction of dynamical systems of the second order, and analyze the asymptotic stability of large scale contincous-time and discrete-time systems by the decomposition and aggregation method. With this approach we get the less conservative stability results than the existing methods.

  • PDF