Académique Documents
Professionnel Documents
Culture Documents
1
This can be re-expressed as: In the linearised approximation, a non-hyperbolic
X equilibrium is a centre. But the topology of the
i t
x(t) = ci e vi (2.0.3) non-linear system at the equilibrium point is not
i necessarily a centre. We cannot make this conclu-
sion since we cannot apply the Hartman-Grobman
see (??) for proof. Theorem - which only works for hyperbolic equi-
libria.
4.1. If A < A (i ) for any i (A is degenerate),
then try a component solution of the form: 6. To investigate the stability of non-hyperbolic
equilibria in the original non-linear system, we
xi (t) = tei t vi + ei t w have the following options:
5. Analyse stability of the equilibrium point by where ws (t) is the stable subspace, E s ; wu (t) is
looking at its eigenvalues. the unstable subspace, E u ; wc (t) is the centre sub-
c
If the equilibrium is hyperbolic, we can conclude space, E .
on the stability of the original non-linear system Each subspace is formed from the linear combina-
using the Hartman-Grobman Theorem. However, tion of eigenvectors which span said subspace, e.g.
if the equilibrium is non-hyperbolic, the Hartman- ws = E s is formed from the linear combination
Grobman Theorem doesnt apply so we cannot use of vis - the eigenvectors corresponding to stable
it to conclude on the non-linear systems stability. eigenvalues - each of which span the subspace, E s .
2
Having identified the subspaces present in the so- 4 Stability of Non-Hyperbolic
lution, x(t), we must now show that these sub- Equilibria
spaces are invariant w.r.t. to the flow, eAt . We
therefore need to decouple the system of equations
If an equilibrium point in the linearised approxi-
in the linear system. Returning to Eqn. (??) and
mation is non-hyperbolic, we cannot conclude that
changing coordinates:
this equilibrium point in the original non-linear
system is a centre, because the Hartman-Grobman
x = Ax Theorem does not apply.
= VV1 x Instead, further analysis is required using the tools
1 1 below:
V x = V x
z = z
4.1 Polar Coordinate Transformation
where T, , and z are defined as follows:
This transforms the coordinate system of the lin-
earised system from Cartesian to Polar Coordi-
.. .. .. nates. Note that this only works for a 2D system,
h . i h . i h . i <2 :
vju
s
T= vi vkc x1 x1 + x2 x2 x1 x2 x2 x1
.
.. .
.. .
..
r = =
r r2
h i where r gives the radius of the trajectory mea-
s
i 0
h i
0 sured from the equilibrium point.
u
= 0 j 0
h i
0 0 ck
4.2 Symmetry
3
4.3 Conservative Systems 4.4 Gradient Systems
4
4.6 LaSalles Invariant Set Theorem 4.6.1 Indirect Trapping Region
It is difficult to find a a true Lyapunov function The indirect method is to simply use the func-
that satisfies condition (3) - strict negative defin- tion, V (x), that satisfies the conditions in Lya-
ity - as it is usually only negative semi-definite. So punovs Direct Method (??) or LaSalles Invari-
Lyapunovs Direct Method cannot be used to con- ant Set Theorem (??). The local region where
clude on asymptotic stability. However, Invariant V (x) satisfies the conditions is the trapping re-
Set Theorem can be used to conclude on asymp- gion. The condition required on the boundary of
totic stability. the trapping region is V = 0.
Besides often yielding conclusions on asymptotic This can be seen from the requirement that
stability when V (x) is only negative semi-definite, V (x) 0 for the region, i.e. the trajectory must
the invariant set theorems also allow us to extend be such that V (x) decreases or remains constant
the concept of Lyapunov function so as to describe over time. Since V (x) is bounded over this region
convergence to dynamic behaviours more general (it is possible to draw closed curves of V (x) = V0 ),
than equilibrium, e.g., convergence to a limit cy- the trajectory must point inward or tangentially
cle. to the boundary of the region.
The invariant set theorems reflect the intuition
that the decrease of V (x) has to gradually van- 4.6.2 Direct Trapping Region
ish (i.e., V (x) has to converge to zero) because
V (x) is lower bounded. The direct (or graphical) method would be to
analyse the vector field of the phase space and
Let V (x) : <n < be a continuously differen-
construct some bounded region defined by a char-
tiable function defined for some set U <n in the
acteristic set of vectors (or vector function), y. A
neighbourhood of x . Assume:
trapping region is defined as having a vector field
that is pointing inwards or tangential to it.
1. for some V0 > 0, the region, D, defined by
In 2D, the bounded region is defined by some
V (x) V0 is bounded
closed curve, C. At any point along C, the tra-
jectory must point inward or lie tangential to C.
2. V (x) 0 x(t) D The exact condition required is as follows:
Let the gradient of the curve at any point be
where the trapping region, D, is assumed to exist. m(C). The direction vector of the trajectory at
any point is given by:
Let R = {x : V (x) = 0} and M be the largest !
x1
invariant set in R. Then, every solution x(t) x =
x2
originating in D tends to M as t .
which has (scalar) gradient:
In the above theorem, the word largest is un-
derstood in the sense of set theory, i.e., M is the x2
m(x) =
union of all invariant sets (e.g., equilibrium points x1
or limit cycles) within R. In particular, if the set which can alternatively be derived by considering
R is itself invariant (i.e., if once V (x) = 0, then the gradient of the trajectory on the phase plane:
V (x) for all future time), then M = R.
dx2
Note that LaSalles Theorem assumes the exis- m (x) =
dx1
tence of the invariant set, D. Note also that V (x)
dx2 dt
is not a Lyapunov function. It is not required to =
be positive definite and V (x) is only required to dt dx1
be negative semi-definite. If V (x) is positive def- x2
=
inite then it is a Lyapunov function whose level x1
sets can be used to generate D.
noting that m(x) = m (x) , where (x), is a
The trapping region, D, can be found indirectly curve representing the trajectorys path in the
or directly. phase plane.
5
The limiting condition to be satisfied for C to be Also, x0 can be written as a linear combination of
the boundary of a trapping region is: the eigenvectors of A:
m(x) = m(C) X
x0 = ci vi (5.1.2)
x2 i
= m(C)
x1
x2 mx1 = 0 Using both Eqn. (??) and (??):
where m = m(C). But more generally,
x(t) = eAt x0
x2 mx1 0 or x2 mx1 0 (4.6.1)
1 2 2
X
= I + At + A t + . . . ci vi
where the choice of inequality depends on the ge- 2
i
ometry. To determine which inequality applies, X X t2 X
draw the tangent to the curve at some point, x, = ci vi + t ci Avi + ci A2 vi
with gradient, m(C). Then draw vectors of x 2
i i i
pointing into the trapping region at x. Only one X X t2 X
of the inequalities can be true. = ci vi + t ci Avi + ci A2 vi
2
i i i
In 3D, the bounded region is defined by some X X t2 X 2
closed surface. At any point on the surface, the = ci vi + t ci i vi + ci i vi
2
trajectory must point inward or lie tangential to i i i
the surface. The exact condition required is as
X 1 2 2
= ci vi 1 + i t + i t
follows: 2
i
X
Let the outward normal of the surface be, n. Then = ci ei t vi
the following must be satisfied i
x n 0 (4.6.2)
i.e. the trajectory is either tangential to the sur- 5.2 Proof that trajectories in Hamilto-
face or points into the region bounded by the sur- nian Systems are orthogonal to tra-
face. jectories in Gradient Systems