Elimination Calculator — Solve Linear Systems Step by Step

Solve systems of linear equations using the elimination method with full Gaussian elimination steps. Free online elimination calculator supports 2×2 and 3×3 systems with detailed working.

Verified Algorithm Step-by-Step Working Privacy First

Elimination Calculator

Enter coefficients for each equation below. The calculator uses Gaussian elimination to solve the system with full step-by-step working.

Equation 1 x+ y=
Equation 2 x+ y=
Enter coefficients and click Calculate Solution to solve the system.

Elimination Method Explained

The elimination method solves systems of linear equations by strategically adding or subtracting equations to cancel out one variable at a time. This transforms the system into an equivalent triangular form that can be solved through back substitution.

Gaussian Elimination Process

  1. Write the augmented matrix — Arrange coefficients and constants in matrix form.
  2. Forward elimination — Use row operations to create zeros below the main diagonal, achieving row echelon form.
  3. Back substitution — Solve for variables starting from the last equation and working upward.
Row operations: Ri ↔ Rj (swap)  |  k·Ri → Ri (scale)  |  Ri + k·Rj → Ri (add multiple)

Types of Solutions

  • Unique solution — The system has exactly one solution (consistent and independent).
  • No solution — The system is inconsistent (equations contradict each other).
  • Infinitely many solutions — The system is dependent (equations describe the same relationship).

How to Solve Systems by Elimination

Follow these steps to solve a linear system using the elimination method:

  1. Write both equations — Ensure variables are aligned in the same order.
  2. Choose a variable to eliminate — Look for coefficients that are equal or opposites, or multiply equations to match coefficients.
  3. Add or subtract equations — Eliminate the chosen variable by adding or subtracting the equations.
  4. Solve for the remaining variable — The result is a single-variable equation.
  5. Back substitute — Plug the found value into one of the original equations to solve for the other variable.
  6. Check your answer — Verify both original equations are satisfied.

For 3×3 systems, repeat the process: eliminate one variable from two pairs of equations, then solve the resulting 2×2 system.

Elimination Calculator Examples

Example 1: Simple 2×2 System

Solve: 2x + 3y = 8 and 4x - 3y = 4

Add equations: (2x+3y)+(4x-3y)=8+4 → 6x=12 → x=2
Substitute: 2(2)+3y=8 → 4+3y=8 → 3y=4 → y=4/3
Solution: x=2, y=4/3

Example 2: System Requiring Multiplication

Solve: 3x + 2y = 7 and 5x - 4y = -3

Multiply Eq1 by 2: 6x+4y=14
Add to Eq2: (6x+4y)+(5x-4y)=14+(-3) → 11x=11 → x=1
Substitute: 3(1)+2y=7 → 2y=4 → y=2
Solution: x=1, y=2

Example 3: 3×3 Gaussian Elimination

Solve: x + y + z = 6, 2x - y + z = 3, x + 2y - z = 2

Eliminate x from Eq2 and Eq3 using Eq1
Eq2-2·Eq1: -3y-z=-9 → 3y+z=9
Eq3-Eq1: y-2z=-4
Solve 2×2: y=2, z=3
Back substitute: x+2+3=6 → x=1
Solution: x=1, y=2, z=3

Real-World Elimination Method Applications

  • Engineering: Solving circuit equations using Kirchhoff's laws for current and voltage analysis.
  • Economics: Finding equilibrium prices in supply-demand models with multiple markets.
  • Chemistry: Balancing complex chemical equations by solving for stoichiometric coefficients.
  • Computer Graphics: Solving for intersection points of lines and planes in 3D rendering.
  • Operations Research: Solving linear programming constraints in optimization problems.
  • Physics: Resolving force vectors and analyzing static equilibrium in mechanical systems.
  • Finance: Portfolio optimization with multiple asset allocation constraints.

People Also Ask

The elimination method is a technique for solving systems of linear equations by adding or subtracting equations to eliminate one variable at a time. It transforms the system into an equivalent triangular form, making it easy to solve through back substitution.
Gaussian elimination works by performing elementary row operations on the augmented matrix: swapping rows, multiplying a row by a nonzero constant, and adding a multiple of one row to another. The goal is to achieve row echelon form where the solution can be read off through back substitution.
Gaussian elimination produces row echelon form and uses back substitution to find solutions. Gauss-Jordan elimination goes further to produce reduced row echelon form (RREF), where the solution can be read directly from the matrix without back substitution.
Yes, the elimination method can solve any system of linear equations. It will either find a unique solution, detect that the system has no solution (inconsistent), or identify that there are infinitely many solutions (dependent system with free variables).
A system of linear equations can have exactly one solution (consistent and independent), no solution (inconsistent — the equations represent parallel lines or planes that never intersect), or infinitely many solutions (consistent and dependent — the equations represent the same line or plane).

Frequently Asked Questions

Yes. Toggle between 2×2 and 3×3 mode using the buttons above the input fields. In 3×3 mode, you can enter coefficients for three equations with three variables (x, y, z) to solve using Gaussian elimination.
The calculator will detect inconsistent systems and inform you that no solution exists. This occurs when the elimination process produces a contradiction, such as 0 = 5, indicating the equations represent parallel lines or planes that never intersect.
The calculator identifies dependent systems with infinitely many solutions. This happens when one equation is a multiple of another, meaning the equations describe the same geometric object. The calculator will indicate this and show the parametric form when possible.
Yes, the step-by-step breakdown shows each elimination operation clearly, including which rows are being combined, the multipliers used, and the resulting simplified system at each stage of the Gaussian elimination process.
Yes, the calculator accepts decimal numbers and fractions. All coefficients can be any real number, and the elimination algorithm handles them correctly to produce accurate solutions.
Gaussian elimination stops at row echelon form and uses back substitution. Gauss-Jordan elimination continues to reduced row echelon form (RREF), making the solution directly readable. This calculator uses Gaussian elimination with back substitution, which is more efficient for most systems.

Elimination Method Glossary

Gaussian Elimination

An algorithm for solving linear systems by performing row operations to transform the augmented matrix into row echelon form.

Augmented Matrix

A matrix formed by appending the constants column to the coefficient matrix, representing the full linear system.

Row Echelon Form

A matrix form where all nonzero rows are above zero rows, and each leading entry is to the right of the leading entry above it.

Back Substitution

The process of solving for variables starting from the last equation and substituting upward to find all values.

Pivot Element

The first nonzero entry in a row of a matrix, used as the basis for eliminating entries below it during Gaussian elimination.

Row Operations

Three operations: swapping rows, multiplying a row by a nonzero scalar, and adding a multiple of one row to another.

Consistent System

A system of equations that has at least one solution. It may have exactly one or infinitely many solutions.

Inconsistent System

A system with no solution, typically revealed during elimination when a contradiction like 0 = k (k ≠ 0) appears.

Editorial Review & Methodology

This elimination calculator was built and reviewed by the NumbrWiz Editorial Team. Gaussian elimination is a foundational algorithm in linear algebra, verified against standard mathematics curricula including Common Core algebra standards and college-level linear algebra textbooks.

  • Algorithm verification: Cross-checked against multiple authoritative linear algebra sources and standard numerical methods references.
  • Edge case testing: Tested with unique solutions, no-solution systems, infinite-solution systems, zero pivots, and ill-conditioned matrices.
  • UX review: Designed for clear coefficient entry with detailed step-by-step breakdown showing each row operation.

Transparency note: All calculations run client-side in your browser. No data is ever collected, stored, or transmitted. Results are for educational purposes; verify critical calculations independently.

Page last reviewed: May 2026 · NumbrWiz Editorial Team