View
227
Download
0
Category
Preview:
Citation preview
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
1/148
CHAPTER 8
Eigenvalues,Diagonalization,
and Special Matrices
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
2/148
OutlineOutline
- Eigenvalues and Eigenvectors- Diagonalization of Matrices
- Orthogonal and Symmetric Matrices- Quadratic Forms- Unitary, Hermitian, and Skew-HermitianMatrices
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
3/148
Eigenvalues and Eigenvectors
Suppose A is an n*n matrix of realnumber. If write an n-vector E as a
column
then AE is an n*1 matrix, which wemay also think of as an n-vector
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
4/148
Mathematics for Computer Engineering4
Vectors have directionsassociated with them. Dependingon A, the direction of AE willgenerally be different from that of
E. It may happen that for somevectorE, AE and E are parallel. Inthis event, there is a number
such that AE = E. Then is calledan eigenvalue of A, with E anassociated eigenvector.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
5/148
Mathematics for Computer Engineering5
Eigenvalues contain importantinformation about the solution o
systems of differential equations, andin models of physical phenomena.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
6/148
Mathematics for Computer Engineering6
DEFINITION 8.1Eigenvalues and
Eigenvectors
A real or complex number is aneigenvalue ofA if there is a nonzero
n*1 matrix (vector) E such that
AE =E
Any nonzero vector E satisfying thisrelationship is called an eigenvectorassociated with the eigenvalue .
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
7/148
Mathematics for Computer Engineering7
Eigenvalues are also known ascharacteristic values of a matrix, and
eigenvectors can be calledcharacteristic vectors.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
8/148
Mathematics for Computer Engineering8
We will typically write eigenvectorsas column matrices and think of them
as vectors in Rn. If an eigenvector has
complex components, we may thinkof it as a vector in C
n. Since an
eigenvector must be a nonzero
vector, at least one component isnonzero.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
9/148
Mathematics for Computer Engineering9
If is a non zero scalar and AE =E,then
A(E) = (AE) =(E)=(E)This mean that nonzero scalarmultiples of eigenvectors are again
eigenvectors.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
10/148
Mathematics for Computer Engineering10
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
11/148
Mathematics for Computer Engineering11
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
12/148
Mathematics for Computer Engineering
12
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
13/148
Mathematics for Computer Engineering
13
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
14/148
Mathematics for Computer Engineering
14
Finding all of the eigenvalues of A
AE =E then
E - AE = 0 or
InE - AE = 0
(In- A)E = 0
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
15/148
Mathematics for Computer Engineering
15
This make E a nontrivial solution ofthe n*n system of linear equations
(In- A)X = 0
This system can have nontrivial
solution if and only if the coefficientmatrix has determinant zero.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
16/148
Mathematics for Computer Engineering
16
Thus, is an eigenvalue ofA exactlywhen
|In
A| = 0
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
17/148
Mathematics for Computer Engineering
17
When the determinant isexpanded, it is a polynomial degreen in , called the characteristicpolynomial of A. The root of this
polynomial are eigenvalues of A.Corresponding to any root , anynontrivial solution E of (I
n- A)X = 0
is an eigenvector associated with .
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
18/148
Mathematics for Computer Engineering
18
Theorem 8.1
Let A be an n*n matrix of real orcomplex numbers. Then,
1. is an eigenvalue ofA if andonly if |I
nA| = 0.
2. If is an eigenvector ofA, then
any nontrivial solution of(In- A)X = 0 is an associated
eigenvector.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
19/148
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
20/148
Mathematics for Computer Engineering
20
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
21/148
Mathematics for Computer Engineering
21
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
22/148
Mathematics for Computer Engineering
22
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
23/148
Mathematics for Computer Engineering
23
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
24/148
Mathematics for Computer Engineering24
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
25/148
Mathematics for Computer Engineering25
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
26/148
Mathematics for Computer Engineering26
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
27/148
Mathematics for Computer Engineering27
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
28/148
Mathematics for Computer Engineering28
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
29/148
Mathematics for Computer Engineering29
Theorem 8.2 Gerschgorin
Let A be an n*n matrix of real orcomplex numbers. For k = 1,...,n, let
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
30/148
Mathematics for Computer Engineering30
Let Ck be a circle of radius rkcentered at (
k,
k), where
kk=
k+i
k. Then each eigenvalue ofA,
when plotted as a point in thecomplex plane, lies on or withinone of the circles C
1,...,C
n.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
31/148
Mathematics for Computer Engineering31
The circles Ck
are called
Gerschgorin circle. For the radius of ,read across row k and add themagnitudes of the row elements,omitting the diagonal element
kk. The
center ofCk
is kk
, plotted as a point in
the complex plane. If the Gerschgorincircles are drawn and the disks they
bound are shaded, then we have apicture of a region containing all of theeigenvalues of A.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
32/148
Mathematics for Computer Engineering32
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
33/148
Mathematics for Computer Engineering33
It is not clear what the roots of this polynomialare. Form the Gerschgorin circles. Their radii are
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
34/148
Mathematics for Computer Engineering34
Gerschgorin circles
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
35/148
Mathematics for Computer Engineering35
Gerschgorin's theorem is notintended as an approximationscheme, since the Gerschgorin circles
may have large radii. For someproblem, however, just knowing someinformation about possible locations ofeigenvalues can be important.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
36/148
Mathematics for Computer Engineering36
Diagonalization of Matrices
The elements aii
of a square matrix is
called main diagonal elements. All other
elements are called off-diagonalelements.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
37/148
Mathematics for Computer Engineering37
DEFINITION 8.3Diagonal Matrix
A square matrix having all off-diagonal elements equal to zero is
called a diagonal matrix
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
38/148
Mathematics for Computer Engineering38
Theorem 8.3
Let
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
39/148
Mathematics for Computer Engineering39
Then
1.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
40/148
Mathematics for Computer Engineering40
2. |D| = d1d
2... d
n
3. D is nonsingular if and only ifeach main element is non zero
4. If each dj 0,then
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
41/148
Mathematics for Computer Engineering41
5. The eigenvalues of D are its main
diagonal elements.6. An eigenvector associated with d
j
is with 1 in row j and allother elements zero.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
42/148
Mathematics for Computer Engineering42
DEFINITION 8.4Diagonalizable Matrix
An n*n matrix A is diagonalizable ithere exists an n*n nonsingular
matrix P such that P-1AP is adiagonal matrix.
When such P exists, we say that P
diagonalizes A
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
43/148
Mathematics for Computer Engineering43
Theorem 8.4 Diagonalizability
Let A be an n*n matrix. Then Ais diagonalizable if it has n linearlyindependent eigenvectors.
Further, if P is the n*n matrixhaving these eigenvectors as
columns, then P-1AP is the
diagonal matrix having thecorresponding eigenvalues downits main diagonal.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
44/148
Mathematics for Computer Engineering44
Suppose 1,...,n are theeigenvalues ofA, and V
1,...,V
nare
corresponding eigenvectors. If
these eigenvectors are linearlyindependent, we can form anonsingular matrix P using V
jas
column j.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
45/148
Mathematics for Computer Engineering45
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
46/148
Mathematics for Computer Engineering46
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
47/148
Mathematics for Computer Engineering47
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
48/148
Mathematics for Computer Engineering48
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
49/148
Mathematics for Computer Engineering49
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
50/148
Mathematics for Computer Engineering50
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
51/148
Mathematics for Computer Engineering51
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
52/148
Mathematics for Computer Engineering52
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
53/148
Mathematics for Computer Engineering53
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
54/148
Mathematics for Computer Engineering54
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
55/148
Mathematics for Computer Engineering55
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
56/148
Mathematics for Computer Engineering56
E l
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
57/148
Mathematics for Computer Engineering57
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
58/148
Mathematics for Computer Engineering58
Eigenvector associated with -3 is
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
59/148
Mathematics for Computer Engineering59
Find eigenvectors associated with -1.
The general solution
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
60/148
Mathematics for Computer Engineering60
Two linearly independent eigenvectors
associated with eigenvalue 1, for example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
61/148
Mathematics for Computer Engineering61
We can form the nonsingular matrix
that diagonalizes A :
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
62/148
Mathematics for Computer Engineering62
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
63/148
Mathematics for Computer Engineering63
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
64/148
Mathematics for Computer Engineering64
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
65/148
Mathematics for Computer Engineering65
Theorem 8.5
Let A be an n*n diagonalizablematrix. Then A has n linearlyindependent eigenvectors. Further,
if Q-1
AQ is a diagonal matrix, thenthe diagonal elements ofQ
-1AQ are
the eigenvalues of A and the
columns of Q are correspondingeigenvectors.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
66/148
Mathematics for Computer Engineering66
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
67/148
Mathematics for Computer Engineering67
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
68/148
Mathematics for Computer Engineering68
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
69/148
Mathematics for Computer Engineering69
Th 8 6
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
70/148
Mathematics for Computer Engineering70
Theorem 8.6
Let the n*n matrix A have ndistinct eigenvalues. Then
corresponding eigenvectors arelinearly independent.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
71/148
Mathematics for Computer Engineering71
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
72/148
Mathematics for Computer Engineering72
Corollary 8 1
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
73/148
Mathematics for Computer Engineering73
Corollary 8.1
Let the n*n matrix A have ndistinct eigenvalues. Then A is
diagonalizable.
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
74/148
Mathematics for Computer Engineering74
p
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
75/148
Mathematics for Computer Engineering75
Orthogonal and Symmetric
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
76/148
Mathematics for Computer Engineering76
g yMatrices
DEFINITION 8.5 Orthogonal Matrix
A real square matrix A is
orthogonal if and only ifAAt = AtA= I
n.
An orthogonal matrix is nonsingular matrix andwe find its inverse simply by taking its transpose.
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
77/148
Mathematics for Computer Engineering77
p
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
78/148
Mathematics for Computer Engineering78
Theorem 8 7
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
79/148
Mathematics for Computer Engineering79
Theorem 8.7
A is an orthogonal matrix if
and only ifA
t
is an orthogonalmatrix .
Theorem 8 8
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
80/148
Mathematics for Computer Engineering80
Theorem 8.8
If A is an orthogonal matrix,then |A| = 1.
A set of vector in Rn
is said to be
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
81/148
Mathematics for Computer Engineering81
A set of vector in R is said to be
orthogonal if any two distinctvectors in the set are orthogonal(that is, their dot product is zero.The set is orthonormal if, inaddition, each vector has length 1.We claim that the row of theorthogonal matrix form an
orthonormal set of vectors, as dothe columns.
From the last example the row
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
82/148
Mathematics for Computer Engineering82
From the last example, the row
vectors are :
These each have length 1. andeach is orthogonal to each othertwo.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
83/148
Mathematics for Computer Engineering83
Similarly, the column vectors are :
Each is orthogonal to the other two,
and each has length 1.
Theorem 8.9
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
84/148
Mathematics for Computer Engineering84
Theorem 8.9
Let A be a real n*n matrix. Then,1. A is orthogonal if and only if therow vectors form an orthonormal set
of vectors in Rn.2. A is orthogonal if and only if thecolumn vectors form an orthonormal
set of vectors in Rn.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
85/148
Mathematics for Computer Engineering85
Determine all 2*2 orthogonal matrix
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
86/148
Mathematics for Computer Engineering86
Determine all 2 2 orthogonal matrix
What do we have to say about a,b, c, and d to make this anorthogonal matrix?
Fi t th t t t b
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
87/148
Mathematics for Computer Engineering87
First, the two row vectors must be
orthogonal and must have length 1.
ac+bd = 0 (8.1)
a2+b2 = 1 (8.2)
c2+d2 = 1 (8.3)
Second the two column vectors
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
88/148
Mathematics for Computer Engineering88
Second, the two column vectors
must also be orthogonal.
Final, |Q| = 1
ab+cd = 0 (8.4)
ad-bc = 1
This lead to two cases.
Case 1 ad-bc = 1
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
89/148
Mathematics for Computer Engineering89
Case 1adbc 1
Multiply equation (8.1) by dto get
acd+bd2= 0
Substitute ad=1+bcinto this equationto get
c(1+bc)+bd2 = 0
c+b(c2+d2)= 0
But from (8.3) c2+d2 = 1
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
90/148
Mathematics for Computer Engineering90
Butfrom (8.3) c d 1
c+b = 0
c = -b
Put this into equation (8.3) to getab - bd= 0
Then b = 0 ora = d, leading to twosubcases.
Case 1(a) b = 0
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
91/148
Mathematics for Computer Engineering91
Then c= -b = 0 also, so
But each row vector has length 1, so a2 =d2 = 1. Further, |Q| = ad= 1 in the presentcase so a = d= 1 ora = d= -1. In thesecase,
Case 1(b) b 0
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
92/148
Mathematics for Computer Engineering92
Then a = d, so
Since a2 + b2 = 1, there is some in [0,2)
such that a = cos() and b = sin(). Then,
This include the 2 results of case 1(a) bychoosing = 0or = 2
Case 1ad-bc= -1
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
93/148
Mathematics for Computer Engineering93
By an analysis similar to that justdone, we find now that, for some ,
This two cases give all the 2*2
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
94/148
Mathematics for Computer Engineering94
orthogonal matrices. For example,with = /4 we get the orthogonalmatrices.
and with =/6 we get the orthogonal
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
95/148
Mathematics for Computer Engineering95
matrices.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
96/148
Mathematics for Computer Engineering96
We can recognize the orthogonalmatrices
as a rotation in the plane.
If the positive x y system is rotated
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
97/148
Mathematics for Computer Engineering97
If the positivex, ysystem is rotated
counterclockwise radian to form anew x', y' system. The coordinates inthe two systems are related by
DEFINITION 8.6 Symmetric Matrix
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
98/148
Mathematics for Computer Engineering98
A square matrix is symmetric ifA = At.
This mean that each aij= a
ji, or that the matrix
elements are the same if reflected across themain diagonal. For example,
Theorem 8 10
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
99/148
Mathematics for Computer Engineering99
Theorem 8.10
The eigenvalues of a real, symmetric
matrix are real numbers.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
100/148
Mathematics for Computer Engineering100
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
101/148
Mathematics for Computer Engineering101
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
102/148
Mathematics for Computer Engineering102
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
103/148
Mathematics for Computer Engineering103
Theorem 8 11
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
104/148
Mathematics for Computer Engineering104
Theorem 8.11
Let A be a real symmetric matrix.
Then eigenvectors associated withdistinct eigenvalues are orthogonal.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
105/148
Mathematics for Computer Engineering105
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
106/148
Mathematics for Computer Engineering106
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
107/148
Mathematics for Computer Engineering107
Theorem 8.12
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
108/148
Mathematics for Computer Engineering108
Theorem 8.12
Let A be a real symmetric matrix.
Then there is a real, orthogonal matrixthat diagonalizes A.
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
109/148
Mathematics for Computer Engineering109
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
110/148
Mathematics for Computer Engineering110
Quadratic Forms
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
111/148
Mathematics for Computer Engineering111
DEFINITION 8.7
A (complex) quadratic form is ansymmetric.
in which each ajk and zj is a complexnumber.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
112/148
Mathematics for Computer Engineering112
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
113/148
Mathematics for Computer Engineering113
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
114/148
Mathematics for Computer Engineering114
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
115/148
Mathematics for Computer Engineering115
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
116/148
Mathematics for Computer Engineering116
Lemma 8.1
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
117/148
Mathematics for Computer Engineering117
Let A be an n*n matrix of real orcomplex numbers. Let be aneigenvalue with eigenvectorZ. Then.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
118/148
Mathematics for Computer Engineering118
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
119/148
Mathematics for Computer Engineering119
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
120/148
Mathematics for Computer Engineering120
Theorem 8.13 Principal AxisTheorem
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
121/148
Mathematics for Computer Engineering121
Let A be a real symmetric matrix witheigenvalues
1,..,
n. Let Q be an
orthogonal matrix that diagonalizes A.
Then the change of variables X = QYtransforms to
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
122/148
Mathematics for Computer Engineering122
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
123/148
Mathematics for Computer Engineering123
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
124/148
Mathematics for Computer Engineering124
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
125/148
Mathematics for Computer Engineering125
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
126/148
Mathematics for Computer Engineering126
Unitary, Hermitian, and Skew-Hermitian Matrices
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
127/148
Mathematics for Computer Engineering127
IfU is a nonsingular complex matrix,U-1 exists and is generally also complexmatrix.
Lemma 8.2
DEFINITION 8.8 Unitary Matrix
A * l t i U i it if
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
128/148
Mathematics for Computer Engineering128
An n*n complex matrix U is unitary ifand only if
or
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
129/148
Mathematics for Computer Engineering129
If U is a real matrix,then the unitary
condition U
t
=In become UU
t
= In which
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
130/148
Mathematics for Computer Engineering130
condition U =In become UU = In, whichmakes U an orthogonal matrix. Unitarymatrix are the complex analogues oforthogonal matrices. Since the rows(or
column) of an orthogonal matrix form anorthonormal set of vectors, we willdevelop the complex analogue of theconcept of orthonormality.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
131/148
Mathematics for Computer Engineering131
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
132/148
Mathematics for Computer Engineering132
DEFINITION 8.9 Unitary System of Vectors
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
133/148
Mathematics for Computer Engineering133
Complex n-vectors F1,...,F
rform a
unitary system if Fj F
k= 0 forj k,
and each Fj
Fj
= 1
THEOREM 8.14
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
134/148
Mathematics for Computer Engineering134
Let U be n*n complex matrix. ThenU is unitary if and only if its rowvectors form a unitary system.
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
135/148
Mathematics for Computer Engineering135
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
136/148
Mathematics for Computer Engineering136
THEOREM 8.15
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
137/148
Mathematics for Computer Engineering137
Let be an eigenvalue of the unitarymatrix U. Then ||= 1.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
138/148
Mathematics for Computer Engineering138
DEFINITION 8.10
1 H iti M t i
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
139/148
Mathematics for Computer Engineering139
1 Hermitian MatrixAn n*n complex matrix H is
hermitian if and only if
2 Skew-Hermitian MatrixAn n*n complex matrix S is skew-
hermitian if and only if
Example
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
140/148
Mathematics for Computer Engineering140
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
141/148
Mathematics for Computer Engineering141
THEOREM 8.16
Let
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
142/148
Mathematics for Computer Engineering142
be a complex matrix. Then
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
143/148
Mathematics for Computer Engineering143
THEOREM 8.17
1 The eigenvalues of a hermitian
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
144/148
Mathematics for Computer Engineering144
1. The eigenvalues of a hermitianmatrix are real.2. The eigenvalues of a skew-hermitian
matrix are zero or pure imaginery.
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
145/148
Mathematics for Computer Engineering145
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
146/148
Mathematics for Computer Engineering146
P P-1AP diagonal matrix
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
147/148
Mathematics for Computer Engineering147
A=
[5 0 0
1 0 3
0 0 2
]
[0 5 0
]
7/28/2019 Eigenvalues, Diagonalization and Special Matrices
148/148
Mathematics for Computer Engineering148
P1AP=[
0 5 0
1 1 3/2
0 0 1 ]
Recommended