Matrix Decompositions

Abstract

Proof. Reorder the rows of A so that Gaussian elimination algorithm does not need to exchange rows—the reordering is described by the permutation matrix P . Run Gaussian elimination for PA, only allowing addition of a multiple of a row to some row with higher index; the resulting matrix is U . The matrix L is obtained by performing the inverse operations on an identity matrix in the reverse order.