1 Diagonalization of a matrix with distinct eigenvalues
Diagonalization means transforming a non-diagonal matrix into an equivalent matrix which is diagonal and hence is simpler to deal with.
A matrix with distinct eigenvalues has, as we mentioned in Property 3 in HELM booklet 22.1, eigenvectors which are linearly independent. If we form a matrix whose columns are these eigenvectors, it can be shown that
so that exists.
The product is then a diagonal matrix whose diagonal elements are the eigenvalues of . Thus if are the distinct eigenvalues of with associated eigenvectors respectively, then
will produce a product
We see that the order of the eigenvalues in matches the order in which is formed from the eigenvectors.
N.B.
- The matrix is called the modal matrix of
- Since is a diagonal matrix with eigenvalues which are the same as those of , then the matrices and are said to be similar .
-
The transformation of
into
using
is said to be a similarity transformation.
Example 8
Let . Obtain the modal matrix and calculate the product . (The eigenvalues and eigenvectors of this particular matrix were obtained earlier in this Workbook at page 7.)
Solution
The matrix has two distinct eigenvalues , with corresponding eigenvectors and . We can therefore form the modal matrix from the simplest eigenvectors of these forms:
(Other eigenvectors would be acceptable e.g. we could use but there is no reason to over complicate the calculation.)
It is easy to obtain the inverse of this matrix and the reader should confirm that:
We can now construct the product :
which is a diagonal matrix with entries the eigenvalues, as expected. Show (by repeating the method outlined above) that had we defined (i.e. interchanged the order in which the eigenvectors were taken) we would find (i.e. the resulting diagonal elements would also be interchanged.)
Task!
The matrix has eigenvalues and 3 with respective
eigenvectors and .
If write down the
products
(You may not need to do detailed calculations.)
Note that demonstrating that any eigenvectors of can be used to form . Note also that since the columns of have been interchanged in forming then so have the eigenvalues in as compared with .
1.1 Matrix powers
If then we can obtain (i.e. make the subject of this matrix equation) as follows:
Multiplying on the left by and on the right by we obtain
Now using the fact that we obtain
We can use this result to obtain the powers of a square matrix, a process which is sometimes useful in control theory. Note that
Clearly, obtaining high powers of directly would in general involve many multiplications. The process is quite straightforward, however, for a diagonal matrix , as this next Task shows.
Task!
Obtain and if . Write down .
Continuing in this way:
We now use the relation to obtain a formula for powers of in terms of the easily calculated powers of the diagonal matrix :
Similarly:
The general result is given in the following Key Point:
Key Point 2
For a matrix with distinct eigenvalues and associated eigenvectors then if
is a diagonal matrix such that
Example 9
If find . (Use the results of Example 8.)
Solution
We know from Example 8 that if then
where
which is easily evaluated.
Exercise
Find a diagonalizing matrix if
Verify, in each case, that is diagonal, with the eigenvalues of as its diagonal elements.
- ,
- ,