Lecture 33
Lecture 33
Let a matrix A is
diagonalizable, with n linearly
independent eigenvectors,
v1, …, vn,
and corresponding
eigenvalues,
1, , n …
For convenience,
assume that the
eigenvectors are
arranged so that
1 2 n
…
Since { v1, …, vn } is a
basis for R , any
n
(k 0,1, 2,...)
Consider a dynamical system
xk+1 = Axk in which A is n × n,
its eigenvalues satisfy 1 1and
1 j for j = 2, ..., n, and v1 is an
eigenvector corresponding to 1.
…
If x0 is given by x0 c1v1 cn v n
with c1 0, then for all sufficiently
large k ,
xk+1 1 xk
xk ci (1 ) v1 k
Plot several trajectories
of the dynamical system
xk+1 = Axk, when
.80 0
A
0 .64
Plot several typical
solution of the equation
xk+1 = Axk, when
1.44 0
A
0 1.2
Plot several typical
solution of the equation
yk+1 = Dyk, where
2.0 0
D
0 0.5 …
Show that a solution
{yk} is unbounded if its
initial point is not on the
x2-axis.
Show that the origin is a
saddle point for solutions
of xk+1 = Axk, where
1.25 0.75
A
-0.75 1.25 …
Find the directions
of greatest
attraction and
greatest repulsion.
If A has two complex
eigenvalues whose absolute
value is greater than 1, then 0
is a repellor and iterates of x0
will spiral outward around the
origin.
…
If the absolute values of
the complex eigenvalues
are less than 1, the origin
is an attractor and the
iterates of x0 spiral inward
toward the origin.
.8 .5
Let A has EV .9 .2i,
.1 1.0
1 2i
with eigenvectors
1
Find trajectories of the system xk+1 = Axk ,
0 3 0
with initial vectors , , and .
2.5 0 2.5
Suppose the search survival
rate of young bird is 50%, and
the stage-matrix A is
0 0 .33
A .3 0 0
0 .71 .94
…
What does the stage-
matrix model predict
about this bird?