In modeling systems, we see that nearly all systems are nonlinear, in that the dif
ferential equations governing the evolution of the systems variables are nonlinear.
However, most of the theory we have developed has centered on linear systems.
So, a question arises: In what limited sense can a nonlinear system be viewed as
a linear system? In this section we develop what is called a Jacobian lineariza
tion of a nonlinear system, about a specic operating point, called an equilibrium
point.
19.1 Equilibrium Points
Consider a nonlinear dierential equation
x(t) = f(x(t), u(t)) (72)
where f is a function mapping R
n
R
m
R
n
. A point x R
n
is called an
equilibrium point if there is a specic u R
m
(called the equilibrium input)
such that
f ( x, u) = 0
n
Suppose x is an equilibrium point (with equilibrium input u). Consider starting
the system (72) from initial condition x(t
0
) = x, and applying the input u(t) u
for all t t
0
. The resulting solution x(t) satises
x(t) = x
for all t t
0
. That is why it is called an equilibrium point.
19.2 Deviation Variables
Suppose ( x, u) is an equilibrium point and input. We know that if we start the
system at x(t
0
) = x, and apply the constant input u(t) u, then the state of the
system will remain xed at x(t) = x for all t. What happens if we start a little
bit away from x, and we apply a slightly dierent input from u? Dene deviation
variables to measure the dierence.
x
(t) := x(t) x
u
(t) := u(t) u
In this way, we are simply relabling where we call 0. Now, the variables x(t) and
u(t) are related by the dierential equation
x(t) = f(x(t), u(t))
169
From _Dynamic Systems and Feedback_
by Packard, Poola, Horowitz, 2002
Copyright 2002, Andrew Packard
All rights reserved.
Do not duplicate or redistribute.
Substituting in, using the constant and deviation variables, we get
x
(t) = f ( x +
x
(t), u +
u
(t))
This is exact. Now however, lets do a Taylor expansion of the right hand side,
and neglect all higher (higher than 1st) order terms
x
(t) f ( x, u) +
f
x
x= x
u= u
x
(t) +
f
u
x= x
u= u
u
(t)
But f( x, u) = 0, leaving
x
(t)
f
x
x= x
u= u
x
(t) +
f
u
x= x
u= u
u
(t)
This dierential equation approximately governs (we are neglecting 2nd order and
higher terms) the deviation variables
x
(t) and
u
(t), as long as they remain
small. It is a linear, timeinvariant, dierential equation, since the derivatives of
x
are linear combinations of the
x
variables and the deviation inputs,
u
. The
matrices
A :=
f
x
x= x
u= u
R
nn
, B :=
f
u
x= x
u= u
R
nm
(73)
are constant matrices. With the matrices A and B as dened in (73), the linear
system
x
(t) = A
x
(t) + B
u
(t)
is called the Jacobian Linearization of the original nonlinear system (72), about
the equilibrium point ( x, u). For small values of
x
and
u
, the linear equation
approximately governs the exact relationship between the deviation variables
u
and
x
.
For small
u
(ie., while u(t) remains close to u), and while
x
remains small
(ie., while x(t) remains close to x), the variables
x
and
u
are related by the
dierential equation
x
(t) = A
x
(t) + B
u
(t)
In some of the rigid body problems we considered earlier, we treated problems
by making a smallangle approximation, taking and its derivatives
and
very
small, so that certain terms were ignored (
2
,
sin ) and other terms simplied
(sin , cos 1). In the context of this discussion, the linear models we
obtained were, in fact, the Jacobian linearizations around the equilibrium point
= 0,
= 0.
If we design a controller that eectively controls the deviations
x
, then we have
designed a controller that works well when the system is operating near the equi
librium point ( x, u). We will cover this idea in greater detail later. This is a
common, and somewhat eective way to deal with nonlinear systems in a linear
manner.
170
19.3 Tank Example
Consider a mixing tank, with constant supply temperatures T
C
and T
H
. Let the
inputs be the two ow rates q
C
(t) and q
H
(t). The equations for the tank are
h(t) =
1
A
T
_
q
C
(t) + q
H
(t) c
D
A
o
_
2gh(t)
_
T
T
(t) =
1
h(t)A
T
(q
C
(t) [T
C
T
T
(t)] + q
H
(t) [T
H
T
T
(t)])
Let the state vector x and input vector u be dened as
x(t) :=
_
h(t)
T
T
(t)
_
, u(t) :=
_
q
C
(t)
q
H
(t)
_
f
1
(x, u) =
1
A
T
_
u
1
+ u
2
c
D
A
o
2gx
1
_
f
2
(x, u) =
1
x
1
A
T
(u
1
[T
C
x
2
] + u
2
[T
H
x
2
])
Intuitively, any height
h > 0 and any tank temperature
T
T
satisfying
T
C
T
T
T
H
should be a possible equilibrium point (after specifying the correct values of the
equilibrium inputs). In fact, with
h and
T
T
chosen, the equation f( x, u) = 0 can
be written as
_
1 1
T
C
x
2
T
H
x
2
_ _
u
1
u
2
_
=
_
c
D
A
o
2g x
1
0
_
The 2 2 matrix is invertible if and only if T
C
= T
H
. Hence, as long as T
C
= T
H
,
there is a unique equilibrium input for any choice of x. It is given by
_
u
1
u
2
_
=
1
T
H
T
C
_
T
H
x
2
1
x
2
T
C
1
_ _
c
D
A
o
2g x
1
0
_
This is simply
u
1
=
c
D
A
o
2g x
1
(T
H
x
2
)
T
H
T
C
, u
2
=
c
D
A
o
2g x
1
( x
2
T
C
)
T
H
T
C
Since the u
i
represent ow rates into the tank, physical considerations restrict
them to be nonegative real numbers. This implies that x
1
0 and T
C
T
T
T
H
.
Looking at the dierential equation for T
T
, we see that its rate of change is inversely
related to h. Hence, the dierential equation model is valid while h(t) > 0, so
we further restrict x
1
> 0. Under those restrictions, the state x is indeed an
equilibrium point, and there is a unique equilibrium input given by the equations
above.
Next we compute the necessary partial derivatives.
_
f
1
x
1
f
1
x
2
f
2
x
1
f
2
x
2
_
=
_
_
gc
D
Ao
A
T
2gx
1
0
u
1
[T
C
x
2
]+u
2
[T
H
x
2
]
x
2
1
A
T
(u
1
+u
2
)
x
1
A
T
_
_
171
_
f
1
u
1
f
1
u
2
f
2
u
1
f
2
u
2
_
=
_
1
A
T
1
A
T
T
C
x
2
x
1
A
T
T
H
x
2
x
1
A
T
_
The linearization requires that the matrices of partial derivatives be evaluated at
the equilibrium points. Lets pick some realistic numbers, and see how things
vary with dierent equilibrium points. Suppose that T
C
= 10
, T
H
= 90
, A
T
=
3m
2
, A
o
= 0.05m, c
D
= 0.7. Try
h = 1m and
h = 3m, and for
T
T
, try
T
T
= 25
and
T
T
= 75
. That gives 4 combinations. Plugging into the formulae give the 4 cases
1.
_
h,
T
T
_
= (1m, 25
h,
T
T
_
= (1m, 75
h,
T
T
_
= (3m, 25
h,
T
T
_
= (3m, 75
x
(0) = x(0)
_
1
75
_
=
_
0.10
6.5
_
and
u
1
(t) := u
1
(t) u
1
=
_
0.007 for 0 t 25
0.014 for 25 < t 100
u
2
(t) := u
2
(t) u
2
=
_
0.014 for 0 t 60
0.021 for 60 < t 100
To compare the simulations, we must rst plot x(t) from the nonlinear simulation.
This is the true answer. For the linearization, we know that
x
approximately
governs the deviations from x. Hence, for that simulation we should plot x+
x
(t).
These are shown below for both h and T
T
.
173
0 10 20 30 40 50 60 70 80 90 100
1
1.05
1.1
1.15
1.2
1.25
1.3
Water Height: Actual (solid) and Linearization (dashed)
M
e
t
e
r
s
0 10 20 30 40 50 60 70 80 90 100
66
68
70
72
74
76
78
80
82
Water Temp: Actual (solid) and Linearization (dashed)
D
e
g
r
e
e
s
Time
19.4 Linearizing about general solution
In section 19.2, we discussed the linear dierential equation which governs small
deviations away from an equilibrium point. This resulted in a linear, timeinvariant
dierential equation.
Often times, more complicated situations arise. Consider the task of controlling a
rocket trajectory from Earth to the moon. By writing out the equations of motion,
from Physics, we obtain state equations of the form
x(t) = f(x(t), u(t), d(t), t) (74)
where u is the control input (thrusts), d are external disturbances.
174
Through much computer simulation, a preplanned input schedule is developed,
which, under ideal circumstances (ie., d(t) 0), would get the rocket from Earth
to the moon. Denote this preplanned input by u(t), and the ideal disturbance by
d(t) (which we assume is 0). This results in an ideal trajectory x(t), which solves
the dierential equation,
x(t) = f
_
x(t), u(t),
d(t), t
_
Now, small nonzero disturbances are expected, which lead to small deviations in
x, which must be corrected by small variations in the preplanned input u. Hence,
engineers need to have a model for how a slightly dierent input u(t) +
u
(t) and
slightly dierent disturbance
d(t) +
d
(t) will cause a dierent trajectory. Write
x(t) in terms of a deviation from x(t), dening
x
(t) := x(t) x(t), giving
x(t) = x(t) +
x
(t)
Now x, u and d must satisfy the dierential equation, which gives
x(t) = f (x(t), u(t), d(t), t)
x(t) +
x
(t) = f
_
x(t) +
x
(t), u(t) +
u
(t),
d(t) +
d
(t), t
_
f ( x(t), u(t), 0, t) +
f
x
x(t)= x(t)
u(t)= u(t)
d(t)=
d(t)
x
(t) +
f
u
x(t)= x(t)
u(t)= u(t)
d(t)=
d(t)
u
(t) +
f
d
x(t)= x(t)
u(t)= u(t)
d(t)=
d(t)
d
(t)
But the functions x and u satisfy the governing dierential equation, so
x(t) =
f ( x(t), u(t), 0, t), leaving the (approximate) governing equation for
x
x(t) =
f
x
x(t)= x(t)
u(t)= u(t)
d(t)=
d(t)
x
(t) +
f
u
x(t)= x(t)
u(t)= u(t)
d(t)=
d(t)
u
(t) +
f
d
x(t)= x(t)
u(t)= u(t)
d(t)=
d(t)
d
(t)
Dene timevarying matrices A, B
1
and B
2
by
A(t) :=
f
x
x(t)= x(t)
u(t)= u(t)
d(t)=
d(t)
B
1
(t) :=
f
u
x(t)= x(t)
u(t)= u(t)
d(t)=
d(t)
B
2
(t) :=
f
d
x(t)= x(t)
u(t)= u(t)
d(t)=
d(t)
The deviation variables are approximately governed by
x
(t) = A(t)
x
(t) +B
1
(t)
u
(t) +B
2
(t)
d
(t) = A(t)
x
(t) +
_
B
1
(t) B
2
(t)
_
_
u
(t)
d
(t)
_
This is called the linearization of system (74) about the trajectory
_
x, u,
d
_
. This
type of linearization is a generalization of linearizations about equilibrium points.
Linearizing about an equilibrium point yields a LTI system, while linearizing about
a trajectory yields an LTV system.
In general, these types of calculations are carried out numerically,
simulink to get solution x(t) given particular inputs u(t) and
d(t)
175
Numerical evaluation of
f
x
, etc, evaluated at the solution points
Storing the timevarying matrices A(t), B
1
(t), B
2
(t) for later use
In a simple case it is possible to analytically determine the timevarying matrices.
19.5 Problems
1. The temperature in a particular 3dimensional solid is a function of position,
and is known to be
T(x, y, z) = 42 + (x 2)
2
+ 3 (y 4)
2
5 (z 6)
2
+ 2yz
(a) Find the rst order approximation (linearization) of the temperature
near the location (4, 6, 0). Use
x
,
y
and
z
as your deviation variables.
(b) What is the maximum error between the actual temperature and the
rst order approximation formula for 
x
 0.3, 
y
 0.2, 
z
 0.1.
You may use Matlab to solve this numerically, or analytically if you
wish.
(c) More generally, suppose that x R, y R, z R. Find the rst order
approximation of the temperature near the location ( x, y, z).
2. The pitchingaxis of a tailn controlled missile is governed by the nonlinear
state equations
(t) = K
1
Mf
n
((t), M) cos (t) + q(t)
q(t) = K
2
M
2
[f
m
((t), M) + Eu(t)]
Here, the states are x
1
:= , the angleofattack, and x
2
:= q, the angular
velocity of the pitching axis. The input variable, u, is the deection of the
n which is mounted at the tail of the missile. K
1
, K
2
, and E are physical
constants, with E > 0. M is the speed (Mach) of the missile, and f
n
and
f
m
are known, dierentiable functions (from windtunnel data) of and M.
Assume that M is a constant, and M > 0.
(a) Show that for any specic value of , with   <
2
, there is a pair ( q, u)
such that
_
q
_
, u
is an equilibrium point of the system (this represents a turn at a constant
rate). Your answer should clearly show how q and u are functions of ,
and will most likely involve the functions f
n
and f
m
.
(b) Calculate the Jacobian Linearization of the missile system about the
equilibrium point. Your answer is fairly symbolic, and may depend on
partial derivatives of the functions f
n
and f
m
. Be sure to indicate where
the various terms are evaluated.
176
3. (Taken from Introduction to Dynamic Systems Analysis, T.D. Burton,
1994) Constants and are given. Let f
1
(x
1
, x
2
) := x
1
x
3
1
+ x
1
x
2
, and
f
2
(x
1
, x
2
) := x
2
+ x
1
x
2
. Consider the 2state system x(t) = f(x(t)).
(a) Note that there are no inputs. Find all equilibrium points of this system
(b) Derive the Jacobian linearization which describes the solutions near each
equilibrium point.
4. Car Engine Model (the reference for this problem is Cho and Hedrick, Au
tomotive Powertrain Modelling for Control, ASME Journal of Dynamic
Systems, Measurement and Control, vol. 111, No. 4, December 1989): In
this problem we consider a 1state model for an automotive engine, with the
transmission engaged in 4th gear. The engine state is m
a
, the mass of air (in
kilograms) in the intake manifold. The state of the drivetrain is the angular
velocity,
e
, of the engine. The input is the throttle angle, , (in radians).
The equations for the engine is
m
a
(t) = c
1
T((t)) c
2
e
(t)m
a
(t)
T
e
= c
3
m
a
(t)
where we treat
e
and as inputs, and T
e
as an output. The drivetrain is
modeled
e
(t) =
1
J
e
[T
e
(t) T
f
(t) T
d
(t) T
r
(t)]
The meanings of the terms are as follows:
T() is a throttle ow characteristic depending on throttle angle,
T() =
_
_
T() for < 0
1 cos (1.14 0.0252) for 0 1.4
1 for > 1.4
T
e
is the torque from engine on driveshaft, c
3
= 47500 Nm/kg.
T
f
is engine friction torque (Nm), T
f
= 0.106
e
+ 15.1
T
d
is torque due to wind drag (Nm), T
d
= c
4
2
e
, with c
4
= 0.0026 Nms
2
T
r
is torque due to rolling resistance at wheels (Nm), T
r
= 21.5.
J
e
is the eective moment of inertia of the engine, transmission, wheels,
car, J
e
= 36.4kgm
2
c
1
= 0.6kg/s, c
2
= 0.095
In 4th gear, the speed of car, v (m/s), is related to
e
as v = 0.129
e
.
(a) Combine these equations into state variable form.
x(t) = f(x(t), u(t))
y(t) = h(x(t))
where x
1
= m
a
, x
2
=
e
, u = and y = v.
177
(b) For the purpose of calculating the Jacobian linearization, explicitly write
out the function f(x, u) (without any t dependence). Note that f maps
3 real numbers (x
1
, x
2
, u) into 2 real numbers. There is no explicit time
dependence in this particular f.
(c) Compute the equilibrium values of m
a
,
e
and so that the car travels
at a constant speed of 22 m/s . Repeat the calculation for a constant
speed of 32 m/s .
(d) Consider deviations from these equilibrium values,
(t) = +
(t)
e
(t) =
e
+
e
(t)
m
a
(t) = m
a
+
ma
(t)
y(t) = y +
y
(t)
Find the (linear) dierential equations that approximately govern these
deviation variables (Jacobian Linearzation discussed in class), in both
the 22 m/s , and 32 m/s case.
(e) Using Simulink, starting from the equilibrium point computed
in part 4c (not [0;0]), apply a sinusoidal throttle angle of
(t) = + sin(0.5t)
for 3 values of , = 0.01, 0.04, 0.1 and obtain the response for v and
m
a
. Compare (and comment) on the dierence between the results
of the true nonlinear simulation and the results from the linearized
analysis. Do this for both cases.
178
20 Linear Systems and TimeInvariance
We have studied the governing equations for many types of systems. Usually, these
are nonlinear dierential equations which govern the evolution of the variables as
time progresses. In section 19.2, we saw that we could linearize a nonlinear
system about an equilibrium point, to obtain a linear dierential equation which
giverns the approximate behavior of the system near the equilibrium point. Also,
in some systems, the governing equations were already linear. Linear dierential
equations are important class of systems to study, and these are the topic of the
next several section.
20.1 Linearity of solution
Consider a vector dierential equation
x(t) = A(t)x(t) + B(t)d(t)
x(t
0
) = x
0
(75)
where for each t, A(t) R
nn
, B(t) R
nm
, and for each time t, x(t) R
n
and
d(t) R
m
.
Claim: The solution function x(), on any interval [t
0
, t
1
] is a linear function of
the pair
_
x
0
, d(t)
[t
0
t
1
]
_
.
The precise meaning of this statement is as follows: Pick any constants , R,
if x
1
(t) is the solution to (75) starting from initial condition x
1,0
(at t
0
) and
forced with input d
1
(t), and
if x
2
(t) is the solution to (75) starting from initial condition x
2,0
(at t
0
) and
forced with input d
2
(t),
then x
1
(t) + x
2
(t) is the solution to (75) starting from initial condition x
1,0
+
x
2,0
(at t
0
) and forced with input d
1
(t) + d
2
(t).
This can be easily checked, note that for every time t, we have
x
1
(t) = A(t)x
1
(t) + B(t)d
1
(t)
x
2
(t) = A(t)x
2
(t) + B(t)d
2
(t)
Multiply the rst equation by the constant and the second equation by , and
add them together, giving
d
dt
[x
1
(t) + x
2
(t)] = x
1
(t) + x
2
(t)
= [Ax
1
(t) + Bd
1
(t)] + [Ax
2
(t) + Bd
2
(t)]
= A[x
1
(t) + x
2
(t)] + B [d
1
(t) + d
2
(t)]
179
which shows that the linear combination x
1
+ x
2
does indeed solve the dif
ferential equation. The initial condition is easily checked. Finally, the existence
and uniqueness theorem for dierential equations tells us that this (x
1
+ x
2
)
is the only solution which satises both the dierential equation and the initial
conditions.
Linearity of the solution in the pair (initial condition, forcing function) is often
called The Principal of Superposition and is an extremely useful property of
linear systems.
20.2 TimeInvariance
A separate issue, unrelated to linearity, is timeinvariance. A system described
by x(t) = f(x(t), d(t), t) is called timeinvariant if (roughly) the behavior of the
system does depend explicitly on the absolute time. In other words, shifting the
time axis does not aect solutions.
Precisely, suppose that x
1
is a solution for the system, starting from x
10
at t = t
0
subject to the forcing d
1
(t), dened for t t
0
.
Now, let x be the solution to the equations starting from x
0
at t = t
0
+, subject
to the forcing
d(t) := d(t), dened for t t
0
+. Suppose that for all choices of
t
0
, , x
0
and d(), the two responses are related by x(t) = x(t) for all t t
0
+.
Then the system described by x(t) = f(x(t), d(t), t) is called timeinvariant.
In practice, the easiest manner to recognize timeinvariance is that the righthand
side of the state equations (the rstorder dierential equations governing the pro
cess) do not explicitly depend on time. For instance, the system
x
1
(t) = 2 x
2
(t) sin [x
1
(t)x
2
(t)d
2
(t)]
x
2
(t) = x
2
(t) x
2
(t)d
1
(t)
is nonlinear, yet timeinvariant.
180
21 Matrix Exponential
21.1 Denition
Recall that for the scalar dierential equation
x(t) = ax(t) + bu(t)
x(t
0
) = x
0
the solution for t t
0
is given by the formula
x(t) = e
a(tt
0
)
+
_
t
t
0
e
a(t)
bu()d
What makes this work? The main thing is the special structure of the exponential
function. Namely that
d
dt
e
at
= ae
at
Now consider a vector dierential equation
x(t) = Ax(t) + Bu(t)
x(t
0
) = x
0
(76)
where A R
nn
, B R
nm
are constant matrices, and for each time t, x(t) R
n
and u(t) R
m
. The solution can be derived by proceeding analogously to the
scalar case.
For a matrix A C
nn
dene a matrix function of time, e
At
C
nn
as
e
At
:=
k=0
t
k
k!
A
k
= I + tA +
t
2
2!
A
2
+
t
3
3!
A
3
+
This is exactly the same as the denition in the scalar case. Now, for any T > 0,
every element of this matrix power series converges absolutely and uniformly on
the interval [0, T]. Hence, it can be dierentiated termbyterm to correctly get
the derivative. Therefore
d
dt
e
At
:=
k=0
k t
k1
k!
A
k
= A + tA
2
+ +
t
2
2!
A
3
+
= A
_
I + tA +
t
2
2!
A
2
+
_
= Ae
At
This is the most important property of the function e
At
. Also, in deriving this
result, A could have been pulled out of the summation on either side. Summarizing
these important identities,
e
A0
= I
n
,
d
dt
e
At
= Ae
At
= e
At
A
181
So, the matrix exponential has properties similar to the scalar exponential function.
However, there are two important facts to watch out for:
WARNING: Let a
ij
denote the (i, j)th entry of A. The (i, j)th entry of
e
At
IS NOT EQUAL TO e
a
ij
t
. This is most convincingly seen with a
nontrivial example. Consider
A =
_
_
1 1
0 1
_
_
A few calculations show that
A
2
=
_
_
1 2
0 1
_
_
A
3
=
_
_
1 3
0 1
_
_
A
k
=
_
_
1 k
0 1
_
_
The denition for e
At
is
e
At
= I + tA +
t
2
2!
A
2
+
t
3
3!
A
3
+
Plugging in, and evaluating on a termbyterm basis gives
e
At
=
_
_
1 + t +
t
2
2!
+
t
3
3!
+ 0 + t + 2
t
2
2!
+ 3
t
3
3!
+
0 + 0 + 0 + 0 + 1 + t +
t
2
2!
+
t
3
3!
+
_
_
The (1, 1) and (2, 2) entries are easily seen to be the power series for e
t
, and
the (2, 1) entry is clearly 0. After a few manipulations, the (1, 2) entry is te
t
.
Hence, in this case
e
At
=
_
_
e
t
te
t
0 e
t
_
_
which is very dierent than the elementbyelement exponentiation of At,
_
_
e
a
11
t
e
a
12
t
e
a
21
t
e
a
22
t
_
_
=
_
_
e
t
e
t
1 e
t
_
_
WARNING: In general,
e
(A
1
+A
2
)t
= e
A
1
t
e
A
2
t
unless t = 0 (trivial) or A
1
A
2
= A
2
A
1
. However, the identity
e
A(t
1
+t
2
)
= e
At
1
e
At
2
is always true. Hence e
At
e
At
= e
At
e
At
= I for all matrices A and all t, and
therefore for all A and t, e
At
is invertible.
182
21.2 Diagonal A
If A C
nn
is diagonal, then e
At
is easy to compute. Specically, if A is diagonal,
it is easy to see that for any k,
A =
_
1
0 0
0
2
0
.
.
.
.
.
.
.
.
.
.
.
.
0 0
n
_
_
A
k
=
_
k
1
0 0
0
k
2
0
.
.
.
.
.
.
.
.
.
.
.
.
0 0
k
n
_
_
In the power series denition for e
At
, any odiagonal terms are identically zero,
and the ith diagonal term is simply
_
e
At
_
ii
= 1 + t
i
+
t
2
2!
2
i
+
t
3
3!
3
i
+ = e
i
t
21.3 Block Diagonal A
If A
1
C
n
1
n
1
and A
2
C
n
2
n
2
, dene
A :=
_
_
A
1
0
0 A
2
_
_
Question: How is e
At
related to e
A
1
t
and e
A
2
t
? Very simply note that for any
k 0,
A
k
=
_
_
A
1
0
0 A
2
_
_
k
=
_
_
A
k
1
0
0 A
k
2
_
_
Hence, the power series denition for e
At
gives
e
At
=
_
_
e
A
1
t
0
0 e
A
2
t
_
_
21.4 Eect of Similarity Transformations
For any invertible T C
nn
,
e
T
1
ATt
= T
1
e
At
T
Equivalently,
Te
T
1
ATt
T
1
= e
At
This can easily be shown from the power series denition.
e
T
1
ATt
= I + t
_
T
1
AT
_
+
t
2
2!
_
T
1
AT
_
2
+
t
3
3!
_
T
1
AT
_
3
+
183
It is easy to verify that for every integer k
_
T
1
AT
_
k
= T
1
A
k
T
Hence, we have (with I written as T
1
IT)
e
T
1
ATt
= T
1
IT + tT
1
AT +
t
2
2!
T
1
A
2
T +
t
3
3!
T
1
A
3
T +
Pull T
1
out on the left side, and T on the right to give
e
T
1
ATt
= T
1
_
I + tA +
t
2
2!
A
2
+
t
3
3!
A
3
+
_
T
which is simply
e
T
1
ATt
= T
1
e
At
T
as desired.
21.5 Candidate Solution To State Equations
The matrix exponential is extremely important in the solution of the vector dier
ential equation
x(t) = Ax(t) + Bu(t) (77)
starting from the initial condition x(t
0
) = x
0
. First, consider the case when B
0
nm
, so that the dierential equation is
x(t) = Ax(t) (78)
with x(t
0
) = x
0
. Proceeding as in the scalar case, a candidate for the solution for
t t
0
is
x
c
(t) := e
A(tt
0
)
x
0
.
We need to check two things
x
c
should satisfy the initial condition plugging in gives
x
c
(t
0
) = e
A(t
0
t
0
)
x
0
= Ix
0
= x
0
which veries the rst condition.
x
c
should satisfy the dierential equation dierentiating the denition of
x
c
gives
x
c
(t) =
d
dt
_
e
A(tt
0
)
x
0
_
=
d
dt
_
e
A(tt
0
)
_
x
0
= Ae
A(tt
0
)
x
0
= Ax
c
(t)
which veries the second condition
184
Hence x
c
(t) := e
A(tt
0
)
x
0
is the solution to the undriven system in equation (78)
for all t t
0
.
Now, consider the original equation in (77). We can derive the solution to the
forced equation using the integrating factor methid, proceeding in the same
manner as in the scalar case, with extra care for the matrixvector operations.
Suppose a function x satises (77). Multiply both sides by e
At
to give
e
At
x(t) = e
At
Ax(t) + e
At
Bu(t)
Move one term to the left, leaving,
e
At
Bu(t) = e
At
x(t) e
At
Ax(t)
= e
At
x(t) Ae
At
x(t)
=
d
dt
_
e
At
x(t)
_
(79)
Since these two functions are equal at every time, we can integrate them over the
interval [t
0
t
1
]. Note that the righthand side of (79) is an exact derivative, giving
_
t
1
t
0
e
At
Bu(t)dt =
_
t
1
t
0
d
dt
_
e
At
x(t)
_
dt
= e
At
x(t)
t
1
t
0
= e
At
1
x(t
1
) e
At
0
x(t
0
)
Note that x(t
0
) = x
0
. Also, multiply both sides by e
At
1
, to yield
e
At
1
_
t
1
t
0
e
At
Bu(t)dt = x(t
1
) e
A(t
1
t
0
)
x
0
This is rearranged into
x(t
1
) = e
A(t
1
t
0
)
x
0
+
_
t
1
t
0
e
A(t
1
t)
Bu(t)dt
Finally, switch variable names, letting be the variable of integration, and letting
t be the right end point (as opposed to t
1
). In these new letters, the expression for
the solution of the (77) for t t
0
, subject to initial condition x(t
0
) = x
0
is
x(t) = e
A(tt
0
)
x
0
+
_
t
t
0
e
A(t)
Bu()d
consisting of a free and forced response.
21.6 Examples
Given R, dene
A :=
_
_
0
0
_
_
185
Calculate
A
2
=
_
_
2
0
0
2
_
_
and hence for any k,
A
2k
=
_
_
(1)
k
2k
0
0 (1)
k
2k
_
_
, A
2k+1
=
_
_
0 (1)
k
2k+1
(1)
k+1
2k+1
0
_
_
Therefore, we can write out the rst few terms of the power series for e
At
as
e
At
=
_
_
1
1
2
2
t
2
+
1
4!
4
t
4
t
1
3!
3
t
3
+
1
5!
5
t
5
t +
1
3!
3
t
3
1
5!
5
t
5
+ 1
1
2
2
t
2
+
1
4!
4
t
4
_
_
which is recognized as
e
At
=
_
_
cos t sin t
sin t cos t
_
_
Similarly, suppose , R, and
A :=
_
_
_
_
Then, A can be decomposed as A = A
1
+ A
2
, where
A
1
:=
_
_
0
0
_
_
, A
2
:=
_
_
0
0
_
_
Note: in this special case, A
1
A
2
= A
2
A
1
, hence
e
(A
1
+A
2
)t
= e
A
1
t
e
A
2
t
Since A
1
is diagonal, we know e
A
1
t
, and e
A
2
t
follows from our previous example.
Hence
e
At
=
_
_
e
t
cos t e
t
sin t
e
t
sin t e
t
cos t
_
_
This is an important case to remember. Finally, suppose F, and
A =
_
_
1
0
_
_
A few calculations show that
A
k
=
_
_
k
k
k1
0
k
_
_
Hence, the power series gives
e
At
=
_
_
e
t
te
t
0 e
t
_
_
186
22 Eigenvalues, eigenvectors, stability
22.1 Diagonalization: Motivation
Recall two facts from Section 21: For diagonal matrices F
nn
,
=
_
1
0 0
0
2
0
.
.
.
.
.
.
.
.
.
.
.
.
0 0
n
_
_
e
t
=
_
_
e
1
t
0 0
0 e
2
t
0
.
.
.
.
.
.
.
.
.
.
.
.
0 0 e
nt
_
_
and: If A F
nn
, and T F
nn
is invertible, and
A := T
1
AT, then
e
At
= Te
At
T
1
Clearly, for a general A F
nn
, we need to study the invertible transformations
T F
nn
such that T
1
AT is a diagonal matrix.
Suppose that T is invertible, and is a diagonal matrix, and T
1
AT = . Moving
the T
1
to the other side of the equality gives AT = T. Let t
i
denote the ith
column of the matrix T. SInce T is assumed to be invertible, none of the columns
of T can be identically zero, hence t
i
=
n
. Also, let
i
denote the (i, i)th entry
of . The ith column of the matrix equation AT = T is just
At
i
= t
i
i
=
i
t
i
This observation leads to the next section.
22.2 Eigenvalues
Denition: Given a matrix A F
nn
. A complex number is an eigenvalue of
A if there is a nonzero vector v C
n
such that
Av = v = v
The nonzero vector v is called an eigenvector of A associated with the eigenvalue
.
Remark: Consider the dierential equation x(t) = Ax(t), with initial condition
x(0) = v. Then x(t) = ve
t
is the solution (check that it satises initial condition
and dierential equation). So, an eigenvector is direction in the statespace such
that if you start in the direction of the eigenvector, you stay in the direction of the
eigenvector.
Note that if is an eigenvalue of A, then there is a vector v C
n
, v =
n
such
that
Av = v = (I) v
187
Hence
(I A) v =
n
Since v =
n
, it must be that det (I A) = 0.
For an n n matrix A, dene a polynomial, p
A
(), called the characteristic
polynomial of A by
p
A
(s) := det (I A)
Here, the symbol s is simply the indeterminate variable of the polynomial.
For example, take
A =
_
_
2 3 1
1 1 1
0 2 0
_
_
Straightforward manipulation gives p
A
(s) = s
3
s
2
+3s2. Hence, we have shown
that the eigenvalues of A are necessarily roots of the equation
p
A
(s) = 0.
For a general n n matrix A, we will write
p
A
(s) = s
n
+ a
1
s
n1
+ + a
n1
s + a
n
where the a
1
, a
2
, . . . , a
n
are complicated products and sums involving the entries
of A. Since the characteristic polynomial of an n n matrix is a nth order
polynomial, the equation p
A
(s) = 0 has at most n distinct roots (some roots
could be repeated). Therefore, a n n matrix A has at most n distinct
eigenvalues.
Conversely, suppose that C is a root of the polynomial equation
p
A
(s)
s=
= 0
Question: Is an eigenvalue of A?
Answer: Yes. Since p
A
() = 0, it means that
det (I A) = 0
Hence, the matrix I A is singular (not invertible). Therefore, by the matrix
facts, the equation
(I A) v =
n
has a nonzero solution vector v (which you can nd by Gaussian elimination).
This means that
v = Av
for a nonzero vector v, which means that is an eigenvalue of A, and v is an
associated eigenvector.
We summarize these facts as:
188
A is a n n matrix
The characteristic polynomial of A is
p
A
(s) := det (sI A)
= s
n
+ a
1
s
n1
+ + a
n1
s + a
n
A complex number is an eigenvalue of A if and only if is a root of the
characteristic equation p
a
() = 0.
Next, we have a useful fact from linear algebra: Suppose A is a given nn matrix,
and (
1
, v
1
) , (
2
, v
2
) , . . . , (
n
, v
n
) are eigenvalue/eigenvector pairs. So, for each i,
v
i
=
n
and Av
i
= v
i
i
. Fact: If all of the {
i
}
n
i=1
are distinct, then the set of
vectors
{v
1
, v
2
, . . . , v
n
}
are a linearly independent set. In other words, the matrix
V := [v
1
v
2
v
n
] C
nn
is invertible.
Proof: Well prove this for 33 matrices check your linear algebra book for the
generalization, which is basically the same proof.
Suppose that there are scalars
1
,
2
,
3
, such that
3
i=1
i
v
i
=
3
This means that
3
= (A
3
I)
3
= (A
3
I)
3
i=1
i
v
i
=
1
(A
3
I) v
1
+
2
(A
3
I) v
2
+
3
(A
3
I) v
3
=
1
(
1
3
) v
1
+
2
(
2
3
) v
2
+
3
(80)
Now multiply by (A
2
I), giving
3
= (A
2
I)
3
= (A
2
I) [
1
(
1
3
)v
1
+
2
(
2
3
)v
2
]
=
1
(
1
3
)(
1
2
)v
1
Since
1
=
3
,
1
=
2
, v
1
=
3
, it must be that
1
= 0. Using equation (80), and
the fact that
2
=
3
, v
2
=
3
we get that
2
= 0. Finally,
1
v
1
+
2
v
2
+
3
v
3
=
3
(by assumption), and v
3
=
3
, so it must be that
3
= 0.
189
22.3 Diagonalization Procedure
In this section, we summarize all of the previous ideas into a stepbystep diago
nalization procedure for n n matrices.
1. Calculate the characteristic polynomial of A, p
A
(s) := det (sI A).
2. Find the n roots of the equation p
A
(s) = 0, and call the roots
1
,
2
, . . . ,
n
.
3. For each i, nd a nonzero vector t
i
C
n
such that
(A
i
I) t
i
=
n
4. Form the matrix
T := [t
1
t
2
t
n
] C
nn
(note that if all of the {
i
}
n
i=1
are distinct from one another, then T is
guaranteed to be invertible).
5. Note that AT = T, where
=
_
1
0 0
0
2
0
.
.
.
.
.
.
.
.
.
.
.
.
0 0
n
_
_
6. If T is invertible, then T
1
AT = . Hence
e
At
= Te
t
T
1
= T
_
_
e
1
t
0 0
0 e
2
t
0
.
.
.
.
.
.
.
.
.
.
.
.
0 0 e
nt
_
_
T
1
We will talk about the case of nondistinct eigenvalues later.
22.4 e
At
as t
For the remainder of the section, assume A has distinct eigenvalues.
if all of the eigenvalues (which may be complex) of A satisfy
Re (
i
) < 0
then e
i
t
0 as t , so all entries of
_
e
At
_
decay to zero
190
If there is one (or more) eigenvalues of A with
Re (
i
) 0
then
e
i
t
bounded = 0
as
Hence, some of the entries of e
At
either do not decay to zero, or, in fact,
diverge to .
So, the eigenvalues are an indicator (the key indicator) of stability of the dierential
equation
x(t) = Ax(t)
if all of the eigenvalues of A have negative real parts, then from any initial
condition x
0
, the solution
x(t) = e
At
x
0
decays to
n
as t (all coordinates of x(t) decay to 0 as t ). In
this case, A is said to be a Hurwitz matrix.
if any of the eigenvalues of A have nonnegative real parts, then from
some initial conditions x
0
, the solution to
x(t) = Ax(t)
does not decay to zero.
22.5 Complex Eigenvalues
In many systems, the eigenvalues are complex, rather than real. This seems un
usual, since the system itself (ie., the physical meaning of the state and input
variables, the coecients in the state equations, etc.) is very much Real. The
procedure outlined in section 22.3 for matrix diagonalization is applicable to both
real and complex eigenvalues, and if A is real, all intermediate complex terms
will cancel, resulting in e
At
being purely real, as expected. However, in the case
of complex eigenvalues it may be more advantageous to use a dierent similarity
transformation, which does not lead to a diagonalized matrix. Instead, it leads to
a real blockdiagonal matrix, whose structure is easily interpreted.
Let us consider a second order system, with complex eigenvalues
x(t) = Ax(t) (81)
where A R
nn
, x R
2
and
p
A
() = det(I
2
A) = ( )
2
+
2
. (82)
191
The two eigenvalues of A are
1
= + j and
2
= j, while the two
eigenvectors of A are given by
(
1
I
2
A)v
1
=
2
(
2
I
2
A)v
2
=
2
. (83)
Notice that, since
2
is the complex conjugate of
1
, v
2
is the complex conjugate
vector of v
1
, i.e. if v
1
= v
r
+ jv
i
, then v
2
= v
r
jv
i
. This last fact can be veried
as follows. Assume that
1
= +j, v
1
= v
r
+jv
i
and insert these expressions in
the rst of Eqs. (83).
[( + j)I
2
A)] [v
r
+ jv
i
] =
2
,
Separating into its real and imaginary parts we obtain
[v
r
v
i
] + j [v
i
+ v
r
] = Av
r
+ jAv
i
[v
r
v
i
] = Av
r
(84)
[v
i
+ v
r
] = Av
i
.
Notice that Eqs. (84) hold if we replace by and v
i
by v
i
. Thus, if
1
=
+j and v
1
= v
r
+jv
i
are respectively an eigenvalue and eigenvector of A, then
2
= j and v
2
= v
r
jv
i
are also respectively an eigenvalue and eigenvector.
Eqs. (84) can be rewritten in matrix form as follows
A
_
v
r
v
i
_
=
_
v
r
v
i
_
_
_
. (85)
Thus, we can dene the similarity transformation matrix
T =
_
v
r
v
i
_
R
22
(86)
and the matrix
J
c
=
_
_
(87)
such that
A = T J
c
T
1
, e
At
= T e
Jct
T
1
. (88)
The matrix exponential e
Jct
is easy to calculate. Notice that
J
c
=
_
_
= I
2
+ S
2
where
I
2
=
_
1 0
0 1
_
and S
2
=
_
0
0
_
192
is skewsymmetric, i.e. S
T
2
= S
2
. Thus,
e
S
2
t
=
_
cos(t) sin(t)
sin(t) cos(t)
_
.
This last result can be veried by dierentiating with respect to time both sides
of the equation:
d
dt
e
S
2
t
= S
2
e
S
2
t
and
d
dt
_
cos(t) sin(t)
sin(t) cos(t)
_
=
_
sin(t) cos(t)
cos(t) sin(t)
_
=
_
0
0
_ _
cos(t) sin(t)
sin(t) cos(t)
_
= S
2
e
S
2
t
.
Since I
2
S
2
= S
2
I
2
, then
e
Jct
= e
t
_
cos(t) sin(t)
sin(t) cos(t)
_
. (89)
22.5.1 Examples
Consider the system
x(t) = Ax(t) (90)
where x R
2
and
A =
_
1.
3 1.
6
1.
6 1.
3
_
.
The two eigenvalues of A are
1
= j and
2
= j. Their corresponding eigenvectors
are respectively
v
1
=
_
0.4243 + 0.5657j
0 + 0.7071j
_
and v
2
=
_
0.4243 0.5657j
0 0.7071j
_
.
Dening
T =
_
0.4243 0.5657
0 0.7071
_
(91)
we obtain A T
2
= T
2
J
c
, where
J
c
=
_
0 1
1 0
_
.
193
Thus,
e
Jct
=
_
cos(t) sin(t)
sin(t) cos(t)
_
and
e
At
= T e
Jct
T
1
=
_
0.4243 0.5657
0 0.7071
_ _
cos(t) sin(t)
sin(t) cos(t)
_ _
2.3570 1.8856
0 1.4142
_
.
Utilizing the coordinate transformation
x
= T
1
x x = Tx
, (92)
where T is given by Eq. (91), we can obtain from Eqs. (92) and(90)
x
(t) =
_
T
1
AT
_
x
(t) (93)
= J
c
x
(t) .
Consider now the initial condition
x(0) =
_
0.4243
0
_
= Tx
(0) , x
(0) =
_
1
0
_
.
The phase plot for x
(t) is given by Fig. 8(a), while that for x(t) is given by Fig.
8(b).
1 0.5 0 0.5 1
1
0.8
0.6
0.4
0.2
0
0.2
0.4
0.6
0.8
1
x*1
x
*
2
0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8
0.6
0.4
0.2
0
0.2
0.4
0.6
x1
x
2
(a) x
= J
c
x
(b) x = Ax
Figure 8: Phase plots
22.6 Problems
1. Find (by hand calculation) the eigenvalues and eigenvectors of the matrix
A =
_
_
3 2 2
5 7 5
5 8 6
_
_
194
Does e
At
have all of its terms decaying to zero?
2. Read about the MatLab command eig (use the MatLab manual, the Matlab
primer, and/or the comnand >> help eig). Repeat problem 1 using eig,
and explain any dierences that you get. If a matrix has distinct eigenvalues,
in what sense are the eigenvectors not unique?
3. Consider the dierential equation x(t) = Ax(t), where x(t) is (3 1) and A
is from problem (1) above. Suppose that the initial condition is
x(0) =
_
_
1
1
0
_
_
Write the initial condition as a linear combination of the eigenvectors, and
nd the solution x(t) to the dierential equation, written as a timedependent,
linear combination of the eigenvectors.
4. Suppose that we have a 2nd order system (x(t) R
2
) governed by the
dierential equation
x(t) =
_
0 2
2 5
_
x(t)
Let A denote the 2 2 matrix above.
(a) Find the eigenvalues an eigenvectors of A. In this problem, the eigen
vectors can be chosen to have all integer entries (recall that eigenvectors
can be scaled)
195
(b) On the grid below (x
1
/x
2
space), draw the eigenvectors.
E
E
E
E
E
E
E
E
E
E
T T T T T T T T T T
6

x
1
x
2
(c) A plot of x
2
(t) vs. x
1
(t) is called a phaseplane plot. The variable t is
not explicitly plotted on an axis, rather it is the parameter of the tick
marks along the plot. On the grid above, using hand calculations, draw
the solution to the equation x(t) = Ax(t) for the initial conditions
x(0) =
_
3
3
_
, x(0) =
_
2
2
_
, x(0) =
_
3
3
_
, x(0) =
_
4
2
_
HINT: Remember that if v
i
are eigenvectors, and
i
are eigenvalues of
A, then the solution to x(t) = Ax(t) from the initial condition x(0) =
2
i=1
i
v
i
is simply
x(t) =
n
i=1
i
e
i
t
v
i
(d) Use Matlab to create a similar picture with many (say 20) dierent
initial conditions spread out in the x
1
, x
2
plane
5. Suppose A is a real, n n matrix, and is an eigenvalue of A, and is not
real, but is complex. Suppose v C
n
is an eigenvector of A associated
with this eigenvalue . Use the notation =
R
+ j
I
and v = v
r
+ jv
I
for
the real and imaginary parts of , and v ( j means
1).
(a) By equating the real and imaginary parts of the equation Av = v, nd
two equations that relate the various real and imaginary parts of and
v.
(b) Show that
(complex conjugate of ) is also an eigenvalue of A. What
is the associated eigenvector?
196
(c) Consider the dierential equation x = Ax for the A described above,
with the eigenvalue and eigenvector v. Show that the function
x(t) = e
R
t
[cos (
I
t) v
R
sin (
I
t) v
I
]
satises the dierential equation. What is x(0) in this case?
(d) Fill in this sentence: If A has complex eigenvalues, then if x(t) starts
on the part of the eigenvector, the solution x(t) oscillates
between the and parts of the eigenvector,
with frequency associated with the part of the eigenvalue.
During the motion, the solution also increases/decreases exponentially,
based on the part of the eigenvalue.
(e) Consider the matrix A
A =
_
1 2
2 1
_
It is possible to show that
A
_
1
2
1
2
j
1
2
j
1
2
_
=
_
1
2
1
2
j
1
2
j
1
2
_ _
1 + 2j 0
0 1 2j
_
Sketch the trajectory of the solution x(t) in R
2
to the dierential equa
tion x = Ax for the initial condition x(0) =
_
1
0
_
.
(f) Find e
At
for the A given above. NOTE: e
At
is real whenever A is real.
See the notes for tricks in making this easy.
6. A hoop (of radius R) is mounted vertically, and rotates at a constant angular
velocity . A bead of mass m slides along the hoop, and is the angle that
locates the bead location. = 0 corresponds to the bead at the bottom of
the hoop, while = corresponds to the top of the hoop.
The nonlinear, 2nd order equation (from Newtons law) governing the beads
197
motion is
mR
+ mg sin +
m
2
Rsin cos = 0
All of the parameters m, R, g, are positive.
(a) Let x
1
(t) := (t) and x
2
(t) :=
(t). Write the 2nd order nonlinear
dierential equation in the statespace form
x
1
(t) = f
1
(x
1
(t), x
2
(t))
x
2
(t) = f
2
(x
1
(t), x
2
(t))
(b) Show that x
1
= 0, x
2
= 0 is an equilibrium point of the system.
(c) Find the linearized system
x
(t) = A
x
(t)
which governs small deviations away from the equilibrium point (0, 0).
(d) Under what conditions (on m, R, , g) is the linearized system stable?
Under what conditions is the linearized system unstable?
(e) Show that x
1
= , x
2
= 0 is an equilibrium point of the system.
(f) Find the linearized system
x
(t) = A
x
(t) which governs small devia
tions away from the equilibrium point (, 0).
(g) Under what conditions is the linearized system stable? Under what
conditions is the linearized system unstable?
(h) It would seem that if the hoop is indeed rotating (with angular velocity
) then there would other equilibrium point (with 0 < < /2). Do
such equilibrium points exist in the system? Be very careful, and please
explain your answer.
(i) Find the linearized system
x
(t) = A
x
(t) which governs small devia
tions away from this equilibrium point.
(j) Under what conditions is the linearized system stable? Under what
conditions is the linearized system unstable?
198
23 Jordan Form
23.1 Motivation
In the last section, we saw that if A F
nn
has distinct eigenvalues, then there
exists an invertible matrix T C
nn
such that T
1
AT is diagonal. In this sense,
we say that A is diagonalizable by similarity transformation (the matrix
T
1
AT is called a similarity transformation of A).
Even some matrices that have repeated eigenvalues can be diagonalized. For in
stance, take A = I
2
. Both of the eigenvalues of A are at = 1, yet A is diagonal
(in fact, any invertible T makes T
1
AT diagonal).
On the other hand, there are other matrices that cannot be diagonalized. Take,
for instance,
A =
_
0 1
0 0
_
The characteristic equation of A is p
A
() =
2
. Clearly, both of the eigenvalues of
A are equal to 0. Hence, if A can be diagonalized, the resulting diagonal matrix
would be the 0 matrix (recall that if A can be diagonalized, then the diagonal
elements are necessarily roots of the equation p
A
() = 0). Hence, there would be
an invertible matrix T such that T
1
AT = 0
22
. Rearranging gives
_
0 1
0 0
_ _
t
11
t
12
t
21
t
22
_
=
_
t
11
t
12
t
21
t
22
_ _
0 0
0 0
_
Multiplying out both sides gives
_
t
21
t
22
0 0
_
=
_
0 0
0 0
_
But if t
21
= t
22
= 0, then T is not invertible. Hence, this 2 2 matrix A cannot
be diagonalized with a similarity transformation.
23.2 Details
It turns out that every matrix can be almost diagonalized using similarity trans
formations. Although this result is not dicult to prove, it will take us too far
from the main ow of the course. The proof can be found in any decent linear
algebra book. Here we simply outline the facts.
199
Denition: If J C
mm
appears as
J =
_
_
1 0 0
0 1 0
.
.
.
.
.
.
1
0 0 0
_
_
then J is called a Jordan block of dimension m, with associated eigenvalue .
Theorem: (Jordan Canonical Form) For every A F
nn
, there exists an invertible
matrix T C
nn
such that
T
1
AT =
_
_
J
1
0 0
0 J
2
0
.
.
.
.
.
.
.
.
.
.
.
.
0 0 J
k
_
_
where each J
i
is a Jordan block.
If J F
mm
is a Jordan block, then using the power series denition, it is straight
forward to show that
e
Jt
=
_
_
e
t
te
t
t
m1
(m1)!
e
t
0 e
t
.
.
.
t
m2
(m2)!
e
t
.
.
.
.
.
.
.
.
.
.
.
.
0 0 e
t
_
_
Note that if Re () < 0, then every element of e
Jt
decays to zero, and if if Re ()
0, then some elements of e
Jt
diverge to .
23.3 Signicance
In general, there is no numerically reliable way to compute the Jordan form of a
matrix. It is a conceptual tool, which, among other things, shows us the extent to
which e
At
contains terms other than exponentials.
Notice that if the real part of is negative, then for any nite integer m,
lim
t
_
t
m
e
t
_
= 0 .
From this result, we see that even in the case of Jordan blocks, the signs of the
real parts of the eigenvalues of A determine the stability of the linear dierential
equation
x(t) = Ax(t)
200