Professional Documents
Culture Documents
Calculation of Eigenvalues and Eigenvectors:: Motivating Example
Calculation of Eigenvalues and Eigenvectors:: Motivating Example
Motivating Example:
Let
1 1
A .
2 4
[solution:]
1 1 x1 .
Ax x (I ) x (I ) x Ax I A x 0
2 4 x 2
Thus,
2 or 3 .
1. As 2 ,
1 1 x1 .
Ax 2 x 2 Ix 2 Ix Ax ( 2 I A) x 0
2 2 x 2
x 1
x 1 t , t R.
x2 1
1
t , t 0, t R, are the eigenvectors
1
associated with 2
1
2. As 3 ,
2 1 x1 .
Ax 3x 3Ix 3Ix Ax (3I A) x 0
2 1 x2
x 1 / 2
x 1 r, r R.
x2 1
1 / 2
r , r 0, r R, are the eigenvectors
1
associated with 3
Note:
In the above example, the eigenvalues of A satisfy the following equation
det(I A) 0 .
After finding the eigenvalues, we can further solve the associated homogeneous
system to find the eigenvectors.
Theorem:
A is singular if and only if 0 is an eigenvalue of A.
[proof:]
: .
A is singular Ax 0 has non-trivial solution There exists a nonzero vector x
such that
Ax 0 0 x .
x is the eigenvector of A associated with eigenvalue 0.
2
:
0 is an eigenvalue of A There exists a nonzero vector x such that
Ax 0 0 x .
The homogeneous system Ax 0 has nontrivial (nonzero) solution.
A is singular.
Theorem:
The eigenvalues of A are the real roots of the characteristic polynomial
of A.
:
Let * be an eigenvalue of A associated with eigenvector u. Also, let f ( ) be the
characteristic polynomial of A. Then,
Au * u u Au Iu Au ( I A)u 0 The homogeneous system
* * *
:
Let r be a real root of f ( ) 0 f ( r ) det( r I A) 0 r I A is a
singular matrix There exists a nonzero vector (nontrivial solution) v such that
(r I A)v 0 Av r v .
v is the eigenvector of A associated with the eigenvalue r .
1. Solve for the real roots of the characteristic equation f ( ) 0 . These real
roots 1 , 2 , are the eigenvalues of A.
Example:
3
Find the eigenvalues and eigenvectors of the matrix
5 4 2
A 4 5 2 .
2 2 2
[solution:]
5 4 2
f ( ) det(I A) 4 5 2 1 10 0
2
2 2 2
1, 1, and 10.
1. As 1 ,
4 4 2 x1
1 I A x 4 4 2 x 2 0 .
2 2 1 x3
x1 s t 1 1
x1 s t , x 2 s, x3 2t x x 2 s s 1 t 0 , s, t R.
x3 2t 0 2
Thus,
1 1
s 1 t
0 , s, t R, s 0 or t 0
,
0
2
2. As 10 ,
5 4 2 x1
10 I A x 4 5 2 x2 0 .
2 2 8 x3
x1 2r 2
x1 2r , x 2 2r , x3 r x x 2 2r r 2, r R.
x3 r 1
Thus,
4
2
r
2 , r R, r 0
,
1
Example:
0 1 2
A 2 3 0 .
0 4 5
[solution:]
1 2
f ( ) det(I A) 2 3 0 1 6 0
2
0 4 5
1, 1, and 6.
3. As 1 ,
1 1 2 x1
A 1 I x 2 2 0 x2 0 .
0 4 4 x3
x1 1
x x 2 t 1, t R.
x3 1
Thus,
1
t
1 , t R, t 0
,
1
4. As 6 ,
5
6 1 2 x1
A 6 I x 2 3 0 x2 0 .
0 4 1 x3
x1 3
x x 2 r 2, r R.
x3 8
Thus,
3
r
2 , r R, r 0
,
8
Note:
In the above example, there are at most 2 linearly independent
3 1
eigenvectors r
2 , r R, r 0
and t
1 , t R, t 0
for 3 3 matrix
8
1
A.
The following theorem and corollary about the independence of the
eigenvectors:
Theorem:
Let u1 , u 2 , , u k be the eigenvectors of a n n matrix A associated with
distinct eigenvalues 1 , 2 , , k , respectively, k n . Then, u1 , u 2 , , u k
are linearly independent.
[proof:]
6
(i.e., u1 , u 2 , , u j is a basis of V). Thus,
j
u j 1 ai ui ,
i 1
Also,
j j
Au j 1 j 1u j 1 j 1 ai ui ai j 1ui
i 1 i 1
Thus,
a j 1 u i 0 .
j j j
ai i u i ai j 1u i
i 1 i 1 i 1
i i
It is contradictory!!
Corollary:
If a n n matrix A has n distinct eigenvalues, then A has n linearly
independent eigenvectors.