Unit 1 · Solving Linear Systems
Chapter 1.2
Elimination, Matrix Operations, and Inverses
The oldest algorithm in the book, made mechanical: pivots knock out unknowns, elimination matrices record every step, and invertibility is exactly 'elimination succeeds'.
13–16 min · in preparation · lesson 2 of 21
By the end
- 01Run elimination with pivots and multipliers, including row exchanges
- 02Multiply matrices and express elimination steps as matrix multiplications
- 03Compute inverses with Gauss-Jordan and characterize when A⁻¹ exists