Professional Documents
Culture Documents
_
matrix A has distinct or repeated eigenvalues separately, and then, in the second case, they
go on to consider the subcases where A is or is not diagonalizable. In doing this, they must
introduce the eigenvalue problem, generalized eigenvectors, and the Jordan canonical form.
It is not necessary to introduce all of these new concepts. At the time when systems of
differential equations are introduced, the students have already learned how to solve the scalar
nth order homogeneous linear differential equation with constant coefficients
X
(n) Cn_lX(n-l) _....qt_ C1 xt .+. COX O.
*Received by the editors March 15, 1995; accepted for publication May 5, 1995.
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1.
507
508 CLASSROOM NOTES
In fact, using reduction of order and a simple induction argument, they can obtain a rigorous
proof of the existence and uniqueness of solutions to the initial value problem for the scalar
Downloaded 03/09/13 to 146.201.208.22. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
equation.
The students can then apply their knowledge of the form of the solution to the scalar
equation to find e at as soon as they find the eigenvalues of the matrix A. The only prerequisite
from linear algebra, aside from being able to find the eigenvalues of A, is the Cayley-Hamilton
theorem, which can be covered at the discretion of the instructor. This method is outlined in
Problems 1.9 (#5 s) on p. 65 in [2], where it is noted that p()) can be any polynomial for which
p(A) 0, not just the characteristic polynomial of A.
2. Preliminaries. Before proceeding with the examples, we need the following two re-
sults. The first theorem guarantees the existence of a unique solution to an initial value problem
for a matrix differential equation, while the second theorem gives a method for constructing
the matrix exponential from the solutions to certain scalar initial value problems.
THEOREM 1. Let A be a constant n n matrix with characteristic polynomial
p()) det()I A) )n + Cn_l)n- +... + Cl) + CO;
then (t) e At is the unique solution to the nth order matrix differential equation
(,)
satisfying the initial conditions
) + c_ n-) + + c + co
’ O,
_
n matrix with characteristic polynomial
509
_
Downloaded 03/09/13 to 146.201.208.22. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
(n-l)
t
(n-l)
(0) 0 262 (0) 0 X (n-l) (0) 1
-
X (n) -Jc- Cn-I x(n-1) -Jr-’’" qt_ C1 xt CO X O,
satisfying the initial conditions stated in the theorem. Then
di)(n) -i- Cn-1 (I)(n-1) -]’-"""-[- C1 (I)t CO(I
(X @ Cn_lX (n-l) 2V @ CIX + C0Xl) I
n)
2t_
(X(nn) .qt_ Cn_lXn(n-l> __...ql_ ClXn .3
V COXn ) An-1
=01 +0A +...-k-OA n-1 --0.
Thus,
(n) (t) + Cn-1 (I)(n-1)(t) +... + C1 (I)’(t) + CO (t) 0
for all 6 , and
(I)(0) Xl(0)I+ x2(0)A +... + xn(O)A n- I
dp’(O) x(O)I + x2(O)A +... + xn’(o)a n- a
Therefore
Downloaded 03/09/13 to 146.201.208.22. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Using this fact we give two examples. In each example the matrix A has a repeated eigenvalue.
In the first example, A is diagonalizable, while in the second example, A is not diagonalizable.
The only work required of the student in each of the examples involves solving initial
value problems for a scalar nth order homogeneous linear differential equation with constant
coefficients. The point to be noted here is that it is no more difficult to solve the second
example than it is to solve the first, even though in the second example the matrix A does not
have a complete set of eigenvectors. Thus, there is no need to consider these cases separately.
Example 1. Given the system of equations
dx
=2x+0y+lz,
dt
dy
dt
Ox + 2 y + Oz,
dz
=Ox+Oy+3z,
dt
we can use the previous theorem to calculate e At, where the coefficient matrix A is given by
x(t) alte
2t
+ a2e 2t -b a3e 3t,
and from this we find the following:
(i) the solution satisfying the initial conditions x(0) 1, x’(0) 0, x"(0) 0 is
(ii) while the solution satisfying the initial conditions x (0) 0, x’(0) 1, x" (0) 0 is
Downloaded 03/09/13 to 146.201.208.22. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
and
2 0
0 2 0
0 0 3 1
therefore
A 2--
4 0 5
0 4 0
0 0 9 1
e At (-6te 2t 3e 2t -+-4e 3t)
I 0 0
0 0 1
+ (5te 2t a t- 4e 2t 4e 3t) 0 2 0
0 0 3
and thus
+(-te 2t
e 2t + e 3t)
4 0 5
0 4 0
0 0 9 1
e 2t e3t _e2t
e TM 0
0
0
e 2t
0
), /3 --"/,
0]
SO that ) is an eigenvalue of multiplicity 3.
512 CLASSROOM NOTES
xl(t)= 1-)t+-
(ii) while the solution satisfying the initial conditions x (0) 0, x (0) 1, x"(0) 0 is
Xz(t) (t ,tZ)e)t;
(iii) finally, the solution satisfying the initial conditions x (0) 0, x (0) 0, x"(0)
is
Also,
and
0
0
)
0
0
1
)
1
)2 2) 1
2 ,2
A 0 2)
0 0 )2
therefore
eAt= (1--,kt+2)e zt 0
0 0
0 + (t )t2)e Lt 0 ) 1
0 0 ,k
2
)2 2. 1
’t
0 ,k 2 2)
"Jr-- e 0 0 2
and so
e At
E t21
0
0 0
2
1
e xt
For more information concerning other methods for calculating the matrix exponential,
the interested reader is referred to the 1978 survey paper by Moler and Van Loan [1 ].
REFERENCES
[1] C. MOLER AND C. VAN LOAN, Nineteen dubious ways to compute the exponential of a matrix, SIAM Rev.,
20 (1978), pp. 801-836.
[2] W.T. REII, Ordinary Differential Equations, John Wiley and Sons, New York, 1971.