MATRIX ALGEBRA (15pts). Using the most appropriate method for a large, sparse matrix, solve A x = b for given Am and bv, in under one minute of wall time. Using MATLAB built-in matrix multiplication techniques is highly recommended. Warning: this A matrix is HUGE (60k x 60k)! If you just look at A without bounds, it will scroll for a long time so I wouldn't do it if I were you. A(1:5, 1:5) is shown below; you may assume that it only has values on the diagonal, exactly as you see here, off into the distance. [ 4 -1 0 0 0 ... -14 -1 0 0 ... 10 -14 -1 0 ... AFO 0 -1 4 -1 ... | 0 0 0 -1 4 ... A= If needed for your method, you must use the norm(x1-x0)orm(x1) (i.e. relative) error criterion for your technique and converge to an accuracy of 5e-3. Plot and submit the resulting answer (x) using the following two lines of code: S = reshape (x, Nx, Ny) ; figure; surf (s); MATRIX ALGEBRA (15pts). Using the most appropriate method for a large, sparse matrix, solve A x = b for given Am and bv, in under one minute of wall time. Using MATLAB built-in matrix multiplication techniques is highly recommended. Warning: this A matrix is HUGE (60k x 60k)! If you just look at A without bounds, it will scroll for a long time so I wouldn't do it if I were you. A(1:5, 1:5) is shown below; you may assume that it only has values on the diagonal, exactly as you see here, off into the distance. [ 4 -1 0 0 0 ... -14 -1 0 0 ... 10 -14 -1 0 ... AFO 0 -1 4 -1 ... | 0 0 0 -1 4 ... A= If needed for your method, you must use the norm(x1-x0)orm(x1) (i.e. relative) error criterion for your technique and converge to an accuracy of 5e-3. Plot and submit the resulting answer (x) using the following two lines of code: S = reshape (x, Nx, Ny) ; figure; surf (s)