What Is Gaussian Elimination? A Complete Guide

Gaussian elimination is a systematic method for solving systems of linear equations. It uses a series of simple row operations to transform the system's augmented matrix into a simpler form—usually row echelon form or reduced row echelon form (RREF)—from which the solutions can be read directly. You can use our Gaussian Elimination Calculator to practice this method step by step with any system of up to five equations and five variables.

History and Origin of Gaussian Elimination

The method is named after the German mathematician Carl Friedrich Gauss, who used it in the early 19th century. However, the core ideas are much older. The ancient Chinese text Jiuzhang Suanshu (Nine Chapters of the Mathematical Art), written around 150 BC, describes a similar procedure for solving systems of linear equations. Over centuries, the algorithm was refined and became a standard part of linear algebra. Today, Gaussian elimination is taught in high schools and colleges worldwide because it is both intuitive and powerful.

Why Gaussian Elimination Matters

Gaussian elimination is not just a classroom exercise. It is the foundation for many computer programs that solve real-world problems. Engineers use it to analyze electrical circuits, economists use it to model market equilibrium, and physicists use it to solve systems in quantum mechanics. Without Gaussian elimination, we would struggle to solve large systems of equations efficiently. For a detailed look at the mathematical formulas behind the row operations, visit our Gaussian Elimination Formula: Matrix Row Operations Explained page.

How Gaussian Elimination Works

The process uses three elementary row operations:

• Row Switching: Swap two rows (R_i ↔ R_j)
• Row Multiplication: Multiply a row by a non-zero constant (kR_i → R_i)
• Row Addition: Add a multiple of one row to another (R_i + kR_j → R_i)

These operations do not change the solution set. The goal is to obtain a matrix in row echelon form (all zeros below the diagonal) and then, if desired, reduced row echelon form (ones on the diagonal and zeros elsewhere).

Worked Example: Solving a 2×2 System

Consider the system:

2x + y = 5
x - y = 1

First, write the augmented matrix:

[ 2   1  | 5 ]
[ 1  -1  | 1 ]

We want a 1 in the top-left corner. Swap rows? We can just use row operations. Let's make the first entry 1 by dividing the first row by 2? But then we get fractions. Instead, swap rows to put 1 in the top-left:

R1 ↔ R2 gives:
[ 1  -1  | 1 ]
[ 2   1  | 5 ]

Now eliminate the 2 below it: replace R₂ with R₂ - 2R₁:

[ 1  -1  | 1 ]
[ 0   3  | 3 ]

Divide the second row by 3:

[ 1  -1  | 1 ]
[ 0   1  | 1 ]

Now back-substitute or continue to RREF. Replace R₁ with R₁ + R₂:

[ 1   0  | 2 ]
[ 0   1  | 1 ]

The solution is x = 2, y = 1. For a complete step-by-step guide with larger systems, see our How to Do Gaussian Elimination Step by Step (2026 Guide).

Common Misconceptions

• Misconception 1: Gaussian elimination only works for square systems. Fact: It works for any system where the number of equations equals the number of variables, or even when they differ. The method can handle rectangular matrices, and the result tells you if there is a unique solution, no solution, or infinitely many solutions.
• Misconception 2: You can multiply a row by zero. Fact: Row multiplication requires a non-zero constant. Multiplying by zero would lose information and change the solution.
• Misconception 3: You must always get a diagonal of ones. Fact: You only get that in reduced row echelon form (RREF). Sometimes the process stops at row echelon form, and you back-substitute.
• Misconception 4: The order of operations doesn't matter. Fact: While there is flexibility, a poor order can lead to many fractions. Good strategies keep numbers simple. For more on solution types and what the final matrix means, check out What Do Gaussian Elimination Results Mean? Solution Types.