1. The complete pivoting strategy is numerically stable, whereas partial pivoting is not always stable. Why is the latter approach preferred in practice in spite of this?
2. Show that for any symmetric positive definite matrix A there is a nonsingular matrix H such that A = HT H.
3. Give three examples of data structures for storing a sparse matrix. Why aren't they used for full (dense) matrices, too?