Consider the following ridiculously simple linear system: 10 (9)(2)-(0) a. What is the solution of this...

Transcribed Image Text:

Consider the following ridiculously simple linear system: 10 (9)(2)-(0) a. What is the solution of this linear system? You don't have to show your work. b. Set up a Neumann iteration with initial guess x0 = (0, 0). Calculate X1, X2, X3, and x4. Show your work. c. Based on your calculations in (b), what will x equal for k >0 when (i) k is odd and (ii) k is even? You don't have to show your work. d. Based on your answer to (c), does the Neumann iteration converge? e. Let M represent the matrix used in your Neumann iteration. Does Mn. 0 as n ? What does this tell you about the convergence of the Neumann iteration method? Is this consistent with your answer to (d)? Consider the following ridiculously simple linear system: 10 (9)(2)-(0) a. What is the solution of this linear system? You don't have to show your work. b. Set up a Neumann iteration with initial guess x0 = (0, 0). Calculate X1, X2, X3, and x4. Show your work. c. Based on your calculations in (b), what will x equal for k >0 when (i) k is odd and (ii) k is even? You don't have to show your work. d. Based on your answer to (c), does the Neumann iteration converge? e. Let M represent the matrix used in your Neumann iteration. Does Mn. 0 as n ? What does this tell you about the convergence of the Neumann iteration method? Is this consistent with your answer to (d)?