Académique Documents
Professionnel Documents
Culture Documents
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 use Gram Schmidt orthonormalization or Householder
triangularization to do the QR factorization. These are similar to the real case with two modifications
except the definition of the length and inner product for vectors of complex numbers need the following
modifications. Let z = and w = be vectors of complex numbers. Then
(2) || z || = = =
Remark. Many books have a slightly different definition of the complex inner product. They define
Note that <z . w> = (z . w)., so these two definition of the complex inner product are essentially equivalent.
If one uses (5) instead of (4), all that is necessary is to reverse the elements in certain inner products. We
shall try to indicate below when that is necessary.
z* = ( 2 + 3i, 5 4i)
|| z || = = =
= 87 + 3i
With these modifications, the Gram - Schmidt process and the QR algorithm is the same as in the real case.
However, one needs to be careful of the order of the vectors in the inner products. Let's illustrate this with
an example.
A - I = A - 3iI =
We need to find the QR factorization of this matrix. Let's use the Gram Schmidt process. We begin with
Q(0) = R(0) = I =
4.16 - 1
R11 = || Q,1 || = || || = 5
Q,1 = =
Now
Q(1) = R(1) =
Step 2. Set R12 = (Q,1 . Q,2) and Q,2 = Q,2 R12Q,1. Here is a case where the order of the elements in the
inner product is important. In one uses the inner product (5), then R12 = <Q,2 . Q,1>. In our example,
Now
Q(2) = R(2) =
R22 = || Q,2 || = || || = 1
Q,2 = = Q,2 =
Now
Q = Q(3) = R = R(3) =
A - I = A - 3iI = = QR =
So
4.16 - 2