Skip to content
Linear Algebra, Optimisation and Numerical Methods / Solving Linear Systems and Matrix Algebra

Gaussian Elimination and Row Echelon Form

Every risk engine that solves a linear system — a replicating portfolio, a hedge ratio, a set of no-arbitrage prices implied by traded instruments — ultimately runs some variant of the algorithm in this note. Gaussian elimination systematically removes unknowns from a system, one at a time, until it is triangular and trivial to solve. This note builds the algorithm from the row picture up, and — the conceptual payoff — shows that each elimination step is itself a matrix multiplication, setting up the A=LUA=LU factorisation of the derivation note that follows.
Learning objectives. By the end of this note you should be able to:
  • carry out forward elimination on a system by hand, tracking pivots and multipliers;
  • recognise when elimination requires a row exchange, and when it fails outright;
  • express one elimination step as multiplication by an elimination matrix;
  • back-substitute to solve a triangular system.

In this lesson

  1. Forward elimination
  2. Back substitution
  3. Elimination matrices
  4. When elimination needs help: row exchanges

Before you start

The full lesson, with worked examples and exercise solutions, is for members.

Read the full lesson

New to SelfMadeQuant.com? See membership options or browse the Linear Algebra, Optimisation and Numerical Methods syllabus.