2. Gaussian Elimination
If , row p cannot be used to eliminate the elements in column p below the diagonal. It is necessary to find row k, where and k > p and then interchange row p and row k so that a nonzero pivot elements is obtained. This process is called pivoting, and the criterion for deciding which row to choose is called a pivoting strategy.