-6
1
1
1
3
4
1.5
0.5
0
1.5
4.5
0
0
-6
1
1
1
3
4
1.5
0.5
0
1.5
4.5
0
0
The Gauss-Jordan Elimination Calculator solves a 2×2 system of linear equations by reducing the augmented matrix to reduced row echelon form (RREF). This systematic algorithm, named after Carl Friedrich Gauss and Wilhelm Jordan, uses elementary row operations to transform any linear system into an equivalent system whose solution can be read directly from the matrix. It is the most general and widely applicable method for solving linear systems.
The method begins with the augmented matrix $$[A|b]$$, which combines the coefficient matrix and the right-hand side vector into a single matrix. Three types of elementary row operations are permitted: swapping two rows, multiplying a row by a non-zero scalar, and adding a multiple of one row to another. These operations do not change the solution set — they transform the system into an equivalent one that is easier to solve.
For a 2×2 system, Gauss-Jordan elimination proceeds in clear steps. First, use the (1,1) entry as a pivot to eliminate the (2,1) entry by subtracting an appropriate multiple of Row 1 from Row 2. This produces an upper triangular matrix. Then, back-substitute to find both unknowns, or continue to full RREF by also eliminating the (1,2) entry using the second pivot. The result is the identity matrix augmented with the solution vector.
Gauss-Jordan elimination has several advantages over other methods. Unlike Cramer's Rule, it naturally handles singular and underdetermined systems by revealing free variables and inconsistencies. Unlike matrix inversion, it works directly on the augmented matrix without requiring the inverse. The algorithm extends seamlessly to systems of any size, making it the standard computational method implemented in numerical software.
The pivot positions in the reduced matrix reveal the rank of the coefficient matrix, the dimension of the solution space, and which variables are free (parameterized). If a pivot appears in every column of the coefficient matrix, the solution is unique. If some columns lack pivots, those variables are free parameters. If a row of zeros in the coefficient part corresponds to a non-zero entry in the augmented part, the system is inconsistent.
This calculator takes a 2×2 augmented matrix (six values) and performs Gauss-Jordan elimination, displaying the solution, the pivot elements, the row multiplier used in elimination, the determinant, and the system classification. Understanding Gauss-Jordan in the 2×2 case builds the foundation for applying the algorithm to larger systems with confidence.
In numerical computing, variants of Gaussian elimination with partial pivoting form the core of direct solvers for dense linear systems. The LAPACK library, used by MATLAB, Python's NumPy, and virtually all scientific software, relies on LU factorization — a closely related method that records the elimination steps as a lower triangular matrix for efficient reuse.
Starting with the augmented matrix:
$$\left[\begin{array}{cc|c} a_{11} & a_{12} & b_1 \\ a_{21} & a_{22} & b_2 \end{array}\right]$$
Step 1: Compute the multiplier $$m = a_{21} / a_{11}$$
Step 2: Row operation $$R_2 \leftarrow R_2 - m \cdot R_1$$:
$$\left[\begin{array}{cc|c} a_{11} & a_{12} & b_1 \\ 0 & a_{22} - m \cdot a_{12} & b_2 - m \cdot b_1 \end{array}\right]$$
Step 3: Back-substitution:
$$x_2 = \frac{b_2 - m \cdot b_1}{a_{22} - m \cdot a_{12}}, \quad x_1 = \frac{b_1 - a_{12} \cdot x_2}{a_{11}}$$
The results show the complete elimination process. The multiplier is the factor used to zero out the (2,1) entry. The pivots are the diagonal elements after elimination — both must be non-zero for a unique solution. If the second pivot is zero, the system is either dependent (infinitely many solutions) or inconsistent (no solution). The determinant equals the product of the original pivots (before scaling), confirming the relationship between Gaussian elimination and determinant computation.
Inputs
Results
m = 4/2 = 2. R2 ← R2 − 2·R1: [0, −1−2, 1−10] = [0, −3, −9]. So x₂ = −9/(−3) = 3. Then x₁ = (5−1·3)/2 = 1. Solution: x₁=1, x₂=3.
Inputs
Results
m = 2/1 = 2. R2 ← R2 − 2·R1: [0, 0, 8−6] = [0, 0, 2]. This gives 0·x₁ + 0·x₂ = 2, which is impossible. The system has no solution — the lines are parallel.
Gaussian elimination reduces to row echelon form (upper triangular) and uses back-substitution to find the solution. Gauss-Jordan elimination continues to reduced row echelon form (RREF), where each pivot is 1 and all other entries in pivot columns are 0, so the solution is read directly. For 2×2 systems, the difference is minimal — one additional row operation. For larger systems, Gauss-Jordan is more work but gives a cleaner result.
There are three types: (1) Swap two rows ($$R_i \leftrightarrow R_j$$), (2) Scale a row by a non-zero constant ($$R_i \leftarrow c \cdot R_i$$), (3) Add a multiple of one row to another ($$R_i \leftarrow R_i + c \cdot R_j$$). These operations are reversible and preserve the solution set. Any system can be solved using only these three operations.
If $$a_{11} = 0$$, you cannot directly use it as a pivot. The solution is partial pivoting: swap Row 1 with a row below that has a non-zero entry in the first column. For a 2×2 system, simply swap the two rows. If both entries in the first column are zero, the first variable is free and the system needs different treatment.
To find $$A^{-1}$$, form the augmented matrix $$[A|I]$$ and apply Gauss-Jordan elimination. If $$A$$ is invertible, the result is $$[I|A^{-1}]$$. The same row operations that reduce $$A$$ to the identity simultaneously transform $$I$$ into $$A^{-1}$$. This is a standard method for computing inverses, especially for 3×3 and larger matrices where the adjugate formula becomes cumbersome.
A matrix is in RREF when: (1) All zero rows are at the bottom, (2) The first non-zero entry (pivot) in each non-zero row is 1, (3) Each pivot is to the right of the pivot above it, (4) Each pivot is the only non-zero entry in its column. RREF is unique for any given matrix — it is a canonical form that makes the solution immediately readable.
Gauss-Jordan elimination requires $$O(n^3)$$ operations while Cramer's Rule requires $$O(n \cdot n!)$$ operations. For $$n = 10$$, that is 1,000 vs. 36 million operations. Additionally, Gauss-Jordan naturally handles singular, underdetermined, and overdetermined systems, while Cramer's Rule only works for square systems with non-zero determinant. Modern numerical libraries all use variants of Gaussian elimination.
Roboculator Team
The Roboculator Team explains calculations, planning tools, and practical formulas in clear language for real-life situations.
How helpful was this calculator?
Be the first to rate!
Matrix Addition Calculator
Linear Algebra Calculators
Matrix Multiplication Calculator
Linear Algebra Calculators
Matrix Determinant Calculator
Linear Algebra Calculators
Matrix Inverse Calculator
Linear Algebra Calculators
Matrix Transpose Calculator
Linear Algebra Calculators
Matrix Rank Calculator
Linear Algebra Calculators
