Gaussian elimination solves a system by reducing its augmented matrix to row-echelon form and then using back-substitution: solve the last equation first, then substitute upwards. Gauss–Jordan elimination continues to reduced row-echelon form so the solution can be read off directly.
Key terms
- Gaussian elimination
- echelon form + back-substitution
- Gauss–Jordan elimination
- reduced echelon form
- Consistent / inconsistent system
- Free variable (parameter)
- Rank
- number of non-zero rows in echelon form
- Homogeneous system
- AX = 0
Key formulas
Summary
- Reduce [A | B] to echelon form, then back-substitute.
- A row [0 … 0 | c], c ≠ 0, means no solution.
- Fewer pivots than unknowns (consistent) means infinitely many solutions.
In everyday life: Ethiopian Airlines planners balancing seats, fuel and crew across several routes solve large linear systems by computer using the same elimination idea.
Check yourself
- What row in echelon form shows a system is inconsistent?
- Why does a homogeneous system always have a solution?
- Solve x + y = 5, x − y = 1 using an augmented matrix.
On WeLearn
The full lesson: reading notes, worked examples, class activities and the Unit 3 quiz
Study Solutions of Systems of Linear Equations on WeLearnTeach Solutions of Systems of Linear Equations with WeLearn
We will bring a demo to your school: a lesson on your interactive TV, a virtual lab and a classroom game, with your own teachers.
