[Solved] CSE6643 Homework 3

Notice: For the computational problems, you must design your own ways, such as using tables and plots etc, to present the results you obtain. And you must show the procedure you take, and explain the results you get, and draw conclusions if you have any. Computer code is not considered as an explanation. Please upload your code in T-square, and return your HW in class on or before the Due date.

• Problem 1: Use inverse power iteration to compute the eigenvector of matrix

that corresponds to the eigenvalue close to = 1.268. You can use calculators, but not computers to help you. Compute at least three iterations and comment on the accuracy of your results.

• Problem 2: Use power iteration to design an algorithm that computes the largest, in the absolute value sense, root of a polynomial p(z) = zⁿ+a₁zⁿ¹++a_n1z+a_n. Justify your answer.
• Problem 3: Suppose A R^mn with m > n and y R^m. Construct an augmented matrix A = [A,y]. Show that the condition number, measured in the induced matrix 2-norm, of A is larger than that of A.
• Problem 4: Let A be a matrix in the following form

Give an detailed algorithm using Givens rotation to compute the QR factorization of A. Write your own code to Implement your algorithm. Apply the code to matrices with randomly generated a_i, b_i and c_i values. Test your code with n = 100,200,400,800, . Comment on the computational complexity of your tests.

• Problem 5: Use the matrix A, with = 0 and = 2 respectively, from of Problem 5 in HW1 to finish the following work. You should run your code for matrix size m = 256,512,1024,. You need comment on your results as well as computation cost.
  • Write your code for the power iteration or the inverse iteration to identify thelargest and smallest eigenvalues of A. How do you speed up the computation?

What is the condition number of A?

• Write your code for QR algorithm to compute the eigenvalues and eigenvectors.

2