Invariants and Liapunov functions for nonautonomous systems
β Scribed by T. Nesemann
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 408 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
If for a difference equation no stability theorem applies, it is necessary to examine this difference equation directly. For many equations, however, it is neither obvious whether solutions are bounded or stable, nor is it trivial to prove such behavior. A useful way to prove boundedness is to find the difference equation's invariant (e.g., see
But what is an invariant? It is hard to find a definition of invariants in the literature on difference equations. Moreover, it turns out that invariants and Liapunov functions are strongly related concepts; in fact, invariants can be considered as special cases of Liapunov functions. For this reason, we shall extend the concept of Liapunov functions to nonautonomons discrete dynamical systems, and we shall supply a general definition for invariants that covers the nonautonomous case also.
π SIMILAR VOLUMES
## Consider the difference equation where xn is in R k and f : D --~ D is continuous where D C R k. Suppose that I : R k ~ R is a continuous invariant, that is, I(f(x)) = I(x) for every x E D. We will show that if I attains an isolated minimum or maximum value at the equilibrium (fixed) point p of
An algorithm is developed to generate a class of matrices N which, when nonsingular, red& a co&a@ square matrix A by a kmilarit~ transfomnation C = NAN-l to the Cwnpanion form. The coeficients of the characteristic equation 1 s1 -A 1 = 0 are dkplayed in the last row of C: stability of the multivaria
We consider the problem of characterizing those systems which admit (weak) Liapunov functions with nice analytic properties. Our investigation gives a rather complete picture of the situation for the one-dimensional case.