Gauss-Jordan elimination
ID: gauss-jordan-elimination
Gauss-Jordan elimination uses elementary row operations to reduce a matrix to reduced row echelon form. After choosing and normalizing each pivot, eliminate entries both below and above it. In a consistent linear system, pivot variables are then expressed directly in terms of free variables.
For example, the augmented matrix with rows and reduces to and , giving . Applied to for an invertible square matrix, it produces . For numerical solution of one system, Gaussian elimination with back substitution usually needs less work, and pivoting is still necessary for numerical reliability.
New to topics? Read the docs here!