Gauss-Jordan elimination is an algorithm to solve a system of linear equation and find the inverse of an invertible matrix.

It first augments a square matrix with identity matrix, and reduces the augmented matrix to to reduced row echelon form:

The algorithm can be seen as an extension to the Gaussian elimination.