4.14 Complex Eigenvalues
4.14.1 Matrices with Complex Eigenvalues
The version of the QR algorithm discussed in the previous sections won't approximate complex
eigenvalues. The reason is that complex e
Exam 1
Math 473/573
Winter 2004
Name: _ This is a closed book exam. You may use the formula sheet handed out
with the exam. Show all work and explain any reasoning which is not clear from the computat
Matrix Computations
Complex numbers
z = x yi
z = =
sign(z) =
if z = x + yi
Vectors
z* = (z1, zn) w* =
for z = w = (w1, , wn)
. w = inner product of z and w
z
for z = and w =
= z*w
= z1w1 + + znwn
z
Final Exam
Math 473/573
Winter 2004
Name: _ This is a closed book exam. You may use the formula sheet handed out
with the exam. Show all work and explain any reasoning which is not clear from the comp
4.15 The Eigenvalues of a 2 2 Matrix
In the version of the QR algorithm discussed in the next section we use as a shift the eigenvalue of the 2
2 submatrix in the lower right corner that is closest t
4.16 The Gram Schmidt Process with Complex Vectors
When we use the QR algorithm with matrices of complex numbers we will be finding the QR factorization
of matrices with complex numbers. We can either
0
>
v
x
x
(VJ
'
X
tl
CAi
I
CA1
r>
US
*
7
/
7
J2_
A
R
o
I
ir.
I
I
~l
U,
I
2^
V*
7
X
F.
fL
/4 
c>
AJ
\
~7^)
*.
\
H
H
M
\
<U
s>
o
'
00
^
N
t
\
M
'O
r^
r^
I
4.
Ui
v4
V
Vi
r:\
Jx!
M
4C^
ft.
ivl
> L
CSis,
k
ft
?s
f
rs
fN
UN
O
n
1
tAJ
u
VN
Hi
!
I
r
fN
*
u
r\
o,
*
e
n
o u
>j

Q
 G
s
0
_
0 G
.
G
C
O
C, 0
A = An
\
o
&
c?
, ^ y
A
A 
*/ 0
o
O
2.
O
/
D
,
c *'
'/ z
1 0 0
0 1 0
0 0 1
Start wit
JtVK*
+0 f K*, 2.
/ *>
(:,
I
7
o
V ? r\
MO
J
\7
j
/
\ \
h i 3
0 /
'
V y
o/
2
F
f
I ' /
1
3
&
f
\
(\1 1J" \ ^ \ \ J
2
V O
f
<r
0
!
I
v, i/,'.
_ 2
_
T V i/
7
V,
T 
L?
/c?
c?
(
v i/
o?
O
o
O
lw
>
