midterm18335fall05solutions

midterm18335fall05solutions - MIT 18.335, Fall 2005:...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: MIT 18.335, Fall 2005: Midterm, Solutions November 10, 2005 Name: Do all of the 8 problems Justify your answers Exam time 80 minutes Grading 1 / 10 2 / 10 3 / 10 4 / 10 5 / 15 6 / 15 7 / 15 8 / 15 /100 1 1. (10 points) (a) Show that ( A ) bardbl A bardbl for any induced matrix norm, where ( A ) is the spectral radius of A (the largest absolute eigenvalue). (b) Show that the condition number ( A ) 1, where is computed with any induced matrix norm. Solution: (a) From the definitions of induced matrix norm and eigenvalues: bardbl A bardbl = sup x negationslash =0 bardbl Ax bardbl bardbl x bardbl bardbl ( A ) x 1 bardbl bardbl x 1 bardbl = ( A ) (b) From the definition of condition number and the bound on induced matrix norms on matrix products: ( A ) = bardbl A 1 bardblbardbl A bardbl bardbl A 1 A bardbl = bardbl I bardbl = 1 2 2. (10 points) Consider the following algorithm applied to an m n matrix A : for j = 1 to n v j = A : ,j R 1: j 1 ,j = Q : , 1: j 1 A : ,j v j = v j R 1: j 1 ,j Q : , 1: j 1 R jj = bardbl v j bardbl 2 Q : ,j = v j /R jj (a) What does the algorithm compute, and which method is used? (b) Calculate the operation count (leading term). Show your work. Correction: Line 4 should be: v j = v j Q : , 1: j 1 R 1: j 1 ,j Solution: (a) The algorithm computes the reduced QR factorization of A , using the classical Gram-Schmidt algorithm. It does not use the modified Gram-Schmidt, since A : ,j is used instead of v j at Line 3. (b) Most work done in lines 3 and 4, with about 4 mj operations per iteration. The total is then: n summationdisplay j =1 4 mj 2 mn 2 3 3. (10 points) Suppose you solve a linear system Ax = b by a backward stable algorithm on a computer with machine = 10...
View Full Document

Page1 / 9

midterm18335fall05solutions - MIT 18.335, Fall 2005:...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online