Gauss–Jordan Elimination Calculator — 2×2 Linear System Solver
Enter the six coefficients of a 2×2 linear system (ax + by = e, cx + dy = f) and see the exact solution — x and y — along with every row operation performed to reach reduced row echelon form.
Solution of the linear system by Gauss–Jordan elimination
Augmented matrix [ a b | e ] [ c d | f ]
R1 ÷ 2 → leading 1 in row 1
R2 − (1) × R1 → 0 in column 1 of row 2
R2 ÷ -1.5 → leading 1 in row 2
R1 − (0.5) × R2 → 0 in column 2 of row 1
Reduced row echelon form — read off solution
How does this calculator work?
Gauss–Jordan elimination reduces the augmented matrix [A|b] to RREF using row operations — scaling, adding multiples, swapping — until the left block is the identity and the right column holds the solution. For a 2×2 system ax + by = e, cx + dy = f the unique solution exists when det = ad − bc ≠ 0.
Formula
How this is calculated
Gauss–Jordan elimination transforms the augmented coefficient matrix of a linear system into Reduced Row Echelon Form (RREF) using three types of elementary row operations: scaling a row by a non-zero constant, adding a multiple of one row to another, and swapping rows. When the left-hand block becomes the identity matrix, the right-hand column holds the solution directly — no back-substitution required.
For a 2×2 system the process has at most five steps: (1) if needed, swap rows to bring a non-zero entry to position (1,1); (2) divide row 1 by the (1,1) entry to make it 1; (3) eliminate the (2,1) entry by subtracting a multiple of row 1 from row 2; (4) divide row 2 by its (2,2) entry; (5) eliminate the (1,2) entry using row 2. The calculator shows each step's row operation label and the resulting matrix in real time.
If the determinant (ad − bc) is zero the matrix is singular: the system either has no solution (inconsistent, parallel lines) or infinitely many solutions (dependent, same line). The calculator detects both cases and reports them rather than producing a spurious numerical result. Numerical inputs trigger floating-point arithmetic; for exact rational results use exact-fraction inputs.
Frequently asked questions
Gaussian elimination reduces the matrix to upper triangular form, then uses back-substitution to find the solution from the bottom up. Gauss–Jordan continues until the matrix is in reduced row echelon form (RREF) — a zero above and below each leading 1 — so the answer can be read off directly from the last column without back-substitution.
A zero determinant (det = ad − bc = 0) means the two equations are linearly dependent — either they describe the same line (infinitely many solutions) or parallel lines (no solutions). Geometrically, the lines do not intersect at a single point, so there is no unique (x, y) pair satisfying both equations simultaneously.
This calculator handles 2×2 systems. The same Gauss–Jordan algorithm extends to any n×n system by repeating the pivot-and-eliminate steps for each column. For 3×3 or larger systems with up to nine variables, use a general matrix solver or a computer algebra system.
Also known as
TG we-Calculate Editorial Team. (2026). Gauss–Jordan Elimination Calculator — 2×2 Linear System Solver [Online calculator]. TG we-Calculate. https://we-calculate.com/calculator/gauss-jordan-elimination-calculator
TG we-Calculate Editorial Team. "Gauss–Jordan Elimination Calculator — 2×2 Linear System Solver." TG we-Calculate. 2026. https://we-calculate.com/calculator/gauss-jordan-elimination-calculator.
TG we-Calculate Editorial Team, "Gauss–Jordan Elimination Calculator — 2×2 Linear System Solver," TG we-Calculate, 2026. [Online]. Available: https://we-calculate.com/calculator/gauss-jordan-elimination-calculator
@misc{wecalculate_gauss_jordan_elimination_calculator, title = {Gauss–Jordan Elimination Calculator — 2×2 Linear System Solver}, author = {{TG we-Calculate Editorial Team}}, howpublished = {\url{https://we-calculate.com/calculator/gauss-jordan-elimination-calculator}}, year = {2026}, note = {TG we-Calculate} }
Did this calculator help you?