Solved: Gaussian elimination with partial pivoting uses the following algorithm to

Chapter 2, Problem 30

(choose chapter or problem)

Gaussian elimination with partial pivoting uses the following algorithm to reduce the augmented matrix: (1) Start with augmented matrix A#. (2) Determine the leftmost nonzero column. (3) Permute rows to put the element of largest absolute value in the pivot position. (4) Use elementary row operations to put zeros beneath the pivot position. (5) If there are no more nonzero rows below the pivot position, go to 7, otherwise go to 6. (6) Apply (2)(5) to the submatrix consisting of the rows that lie below the pivot position. (7) The matrix is in reduced form.6 In 3033, use the preceding algorithm to reduce A# and then apply back substitution to solve the equivalent system. Technology might be useful in performing the required row operations.