Search results
Results from the WOW.Com Content Network
A Lyapunov function for an autonomous dynamical system {: ˙ = ()with an equilibrium point at = is a scalar function: that is continuous, has continuous first derivatives, is strictly positive for , and for which the time derivative ˙ = is non positive (these conditions are required on some region containing the origin).
First, a non-negative function L(t) is defined as a scalar measure of the state of all queues at time t. The function L(t) is typically defined as the sum of the squares of all queue sizes at time t, and is called a Lyapunov function. The Lyapunov drift is defined: = (+) ()
The ordinary Lyapunov function is used to test whether a dynamical system is (Lyapunov) stable or (more restrictively) asymptotically stable. Lyapunov stability means that if the system starts in a state x ≠ 0 {\displaystyle x\neq 0} in some domain D , then the state will remain in D for all time.
Conley's decomposition is characterized by a function known as complete Lyapunov function. Unlike traditional Lyapunov functions that are used to assert the stability of an equilibrium point (or a fixed point) and can be defined only on the basin of attraction of the corresponding attractor, complete Lyapunov functions must be defined on the whole phase-portrait.
A Lyapunov function is a nonnegative scalar measure of this multi-dimensional state. Typically, the function is defined to grow large when the system moves towards undesirable states. System stability is achieved by taking control actions that make the Lyapunov function drift in the negative direction towards zero.
In particular, the discrete-time Lyapunov equation (also known as Stein equation) for is A X A H − X + Q = 0 {\displaystyle AXA^{H}-X+Q=0} where Q {\displaystyle Q} is a Hermitian matrix and A H {\displaystyle A^{H}} is the conjugate transpose of A {\displaystyle A} , while the continuous-time Lyapunov equation is
The definition for discrete-time systems is almost identical to that for continuous-time systems. The definition below provides this, using an alternate language commonly used in more mathematical texts. Let (X, d) be a metric space and f : X → X a continuous function. A point x in X is said to be Lyapunov stable, if,
Consider an irreducible discrete-time Markov chain on a countable state space having a transition probability matrix with elements for pairs , in .Foster's theorem states that the Markov chain is positive recurrent if and only if there exists a Lyapunov function:, such that () and