The problem addressed in this paper is the construction of homogeneous polynomial Lyapunov functions for linear systems with time-varying structured uncertainties. A sufficient condition for the existence of a homogeneous polynomial Lyapunov function of given degree is formulated in terms of a Linear Matrix Inequalities (LMI) feasibility problem. This condition turns out to be also necessary in...

The basin of attraction of an asymptotically stable fixed point of the discrete dynamical system given by the iteration xn+1 = g(xn) can be determined through sublevel sets of a Lyapunov function. In [3] a Lyapunov function is constructed by approximating the solution of a difference equation using radial basis functions. However, the resulting Lyapunov function is non-local, i.e. it has no neg...

The modeling investigation in this paper discusses the system level effects of a toxicant on a three species food chain system. In the models, we have assumed that the presence of top predator reduces the predatory ability of the intermediate predator. The stability analysis of the models is carried out and the sufficient conditions for the existence and extinction of the populations under the ...

We introduce the concept of a Lyapunov game as a subclass of strictly dominated games and potential games. The advantage of this approach is that every ergodic system (repeated game) can be represented by a Lyapunov-like function. A direct acyclic graph is associated with a game. The graph structure represents the dependencies existing between the strategy profiles. By definition, a Lyapunov-li...

In [3] Conley showed that the state-space of a dynamical system can be decomposed into a gradient-like part and a chain-recurrent part, and that this decomposition is characterized by a so-called complete Lyapunov function for the system. In [14] Kalies, Mischaikow, and VanderVorst proposed a combinatorial method to compute discrete approximations to such complete Lyapunov functions. Their appr...