Gauss-Jordan elimination Created 2026-10-20 Updated 2026-11-05
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.
Matrix inversion Created 2026-10-20 Updated 2026-11-05
Matrix inversion computes the matrix inverse of a square matrix satisfying . It is possible exactly when has full rank. One method applies Gauss-Jordan elimination to ; another factors and solves a linear system for each column of .
For with , the inverse is . To solve a single numerical system , a factorization followed by triangular solves is usually preferable to explicitly forming the inverse. A large condition number can amplify input errors regardless of the inversion method.