## Description

1. Implement LU factorization with partial pivoting. Test your code on a simple problem and provide a print-out of your session. Explain how you implemented row interchanges.

2. Consider matrix

A =

0.001 2.000 3.000 −1.000 3.712 4.623 −2.000 1.072 5.643

(a) Write out the detailed process of LU factorization in a computer with four digit mantissa without pivoting. In particular, give M1, M2, etc. (b) Compare with a double precision LU factorization (obtained, e.g. from your code above) (c) Discuss reasons for loss of accuracy in part (a).

3. Compute operation count of the partial and full pivoting to the leading order. An operation here is a comparison of two numbers.

4. Let A = (n,n) be nonsingular. Show that A has an LU factorization if and only if each upper left block A1:k,1:k is nonsingular. Hint: Show ﬁrst that the row operations of Gaussian elimination leave the determinants A1:k,1:k unchanged. 5. (a) Describe an algorithm for computing A−1 by solving n systems of equations, where n is the dimension of A. (b) Calculate the cost of this algorithm and argue that it is preferably not be used (c) Propose a modiﬁcation of the algorithm that takes advantage of sparsity

6. Read about the tridiagonal algorithm in e.g. Quarteroni, Sacco, Saleri ”Numerical Mathematics”, Ch. 3.7.1. Such matrices often arise in numerical solution of PDEs, where a system Ax = b is solved many times with diﬀerent right hand sides. Argue why computing the inverse matrix is a particularly bad idea in this case. 7. Show that the bound on growth factor ρ = maxi,j|uij| maxi,j|aij| is given by 2n−1, where n is the dimension of the matrix.

8. (bonus) Time Matlab lu command and your own code on a random matrix of suﬃciently large size (say, n=1000) using commands tic and toc. Which one is faster? Estimate how long LU factorization should take based only on the number of algebraic operations and the clock speed of your computer. Is the measured run time about your estimate? Next, run LU factorization on a sequence of random matrices, say n=100, n=200, n=400, etc. Do run times scale according to theoretical predictions? If no, then why not?