Beruflich Dokumente
Kultur Dokumente
" X = ax + by
#
$Y = cx + dy
or $ ' = $
'$ ' or
Y
c
d
# & #
&# y &
" x%
q For every vector r = $ y '
# &
"X%
" a b%
M =$
' is
#c d &
R=M r
(x,y)
. (X,Y)
(X,Y)
(x,y) .
O
2
y=
y
2 2
() ( )
5x 2y = x
(5 )x 2y = 0
2x + 2y = y
2x + (2 )y = 0
5 2
=0
2 2
(5 )x 2y = 0
And we got the equations
2x + (2
)y = 0
(1)
(5 )(2 ) 4 = 2 7 + 6 = 0
x + 2y = 0
R = 6r
2x y = 0
R=r
= 1 or = 6
2x y = 0 for = 1
x + 2y = 0 for = 6
q Thus:
" x%
any vector r = $ y ' along 2x y = 0 line
# &
is an eigenvector with eigenvalue = 1 .
%
" x
r = $ ' along x + 2y = 0
# y&
anyvector
line
2x y = 0 for = 1
x + 2y = 0 for = 6
5x1 2y1 = x1
2x1 + 2y1 = y1
and
# 5 2&# x1
%
(%
$ 2 2 '$ y1
x 2 & # x1
( =%
y 2 ' $ y1
" 5 2 % x
$
' y = xy
# 2 2 &
( ) ( ) , we write:
5x 2 2y 2 = 6x 2
2x 2 + 2y 2 = 6y 2
x 2  0&
(%
(
y 2 '$0 6'
#
# 5 2&%
%
(%
$ 2 2 '%
$
1
5
2
5
2 & #
( %
5( =%
1
( %
5 ' $
1
5
2
5
2 &
(
5 (#1 0&
1 %$0 6('
(
5 '
1 2
2 1
, ), r2 = (x 2 , y 2 ) = (
, )
5 5
5 5
MC = CD
C 1MC = D
Diagonalizing a matrix
If we have a square matrix M, we can obtain matrix D using:
D = C 1 MC
Diagonalizing a matrix
q Lets diagonalize matrix M from our previous example:
# 5 2&
M =%
(
$ 2 2 '
5 2
=0
2 2
(5 )(2 ) 4 = 2 7 + 6 = 0
= 1 or = 6
"1 0%
D =$
'
#0 6&
or
"6 0%
D =$
'
#0 1&
Diagonalizing a matrix
y
r = r"
C 1 MC = D
R = R"
%cos
x = x" cos y" sin
& sin
sin (
*
cos )
R = CR'
Mr = CR'
C 1 Mr = C 1CR'
C 1 MC
r # = R'
Dr ' = R'
Thus
Diagonalizing a matrix
y
r = r"
R = R"
$cos
C =&
% sin
sin '
)
cos (
Diagonalizing a matrix
q So now we know that a symmetric matrix can be diagonilized by
orthogonal similarity transformation.
A matrix has a real eigenvalues and can be diagonalized by a
orthogonal similarity transformation if and only if it is symmetric.
q The complex analog of symmetric matrix ( S T = S) is a Hermitian matrix
( H + = H ). The complex analog of orthogonal matrix ( OT = O1 ) is a unitary
matrix ( U + = U 1).
Miscellania
q Powers and functions of matrices
It is easy to find a power of a diagonal matrix:
If
" d1
$
0
$
D=
$0
$
#0
0 0%
'
d2 0 '
0 0'
'
0 0 dn &
then
" d1m
$
0
Dm = $
$0
$
#0
0 0%
'
d2m 0 '
0 0'
'
0 0 dnm &
q Simultaneous
Diagonalization
One can diagonalize two (or more) matrices using the same similarity
transformation if and only if they commute.
11