This new set is due Monday, March 11, at the beginning of lecture.

Write a program that, given a square matrix , computes approximations to its eigenvalues using the QR-algorithm. Ideally, the user can decide the dimensions of the matrix and, more importantly, the error within which the approximations will be found. Apply your method to a matrix, and check the number of iterations the process requires.

Please turn in: The code (best if you email it to me), a write up explaining what your code does, the matrix you applied the method to, and the result. For this, you can work in groups of two or three. In case you cannot find anybody to work with, and do not know ow to program, let me know as soon as possible, and we will find an alternative.

(As extra credit problem, write a program for Francis’s algorithm as well, together with an explanation of your code, and apply the algorithm to the same matrix.)

For the remaining problems, you should turn in your own work. You can still collaborate with others, but please make sure to give appropriate credit and indicate clearly who you worked with, what references you consulted, etc:

Give an example of a matrix for which the power method fails. (Include a proof that this is indeed the case.)

Let be an matrix with complex entries. Consider it as a linear transformation . Verify explicitly that is the unique matrix with the property that for all vectors . Recall that for and , their dot product is given by .

Check that if , then the eigenvalues of are real. To see this, let be an eigenvector of , and consider . In particular, this means that the eigenvalues of a symmetric matrix are real.

More significantly, for any Hermitian matrix , that is, one that satisfies , there is a basis consisting of eigenvectors of . We will prove this in due time.

This entry was posted on Thursday, February 28th, 2013 at 3:02 pm and is filed under 403/503: Linear Algebra II. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.