Chapter 4 — Further Reading

An annotated map to where this chapter's material lives in the standard texts and the best free resources. Gaussian elimination is the one algorithm covered in every linear algebra book, so the question is less "where" than "from what angle" — computational (Strang, Boyd–Vandenberghe), structural (Lay), or the proof-first view that treats elimination as a side-tool (Axler). You need none of these to follow the chapter; reach for them when you want a second voice.

The companion textbooks

• Gilbert Strang, Introduction to Linear Algebra (Wellesley–Cambridge Press), Chapters 2–3. The closest match to this chapter's spirit. Strang teaches elimination as the practical heart of solving $A\mathbf{x}=\mathbf{b}$, introduces pivots and the "row picture vs. column picture" early, and connects elimination directly to the $A=LU$ factorization (his Chapter 2) — exactly the bridge we tee up for our Chapter 10. His treatment of echelon form, free columns, and the special solutions of $A\mathbf{x}=\mathbf{0}$ is the natural next read after §4.6. Best fit for: anyone who wants the computational and structural views together, with applications never far away.

• David C. Lay, Steven Lay & Judi McDonald, Linear Algebra and Its Applications (Pearson), Chapter 1. The gold standard for a careful, example-rich first pass at row reduction. Lay's Sections 1.1–1.2 walk through elementary row operations, echelon and reduced echelon form, and the existence/uniqueness theorem (our §4.7) in meticulous detail, and Section 1.6 is the source of the network-flow and economics applications our case studies build on. If any hand computation in this chapter felt fast, Lay slows it down. Best fit for: readers who want maximum worked detail and the cleanest statement of the pivot/free-variable rules.

• Stephen Boyd & Lieven Vandenberghe, Introduction to Applied Linear Algebra (Cambridge; free PDF at vmls-book.stanford.edu). The applied, numerically minded counterpart. Their treatment frames solving linear equations around real problems and is honest about the cost of algorithms (the $O(n^3)$ count of §4.8) and about why you don't invert a matrix to solve a system — a theme they hammer as hard as we do. Pairs naturally with the efficiency discussion and the from-scratch toolkit. Best fit for: CS / data-science readers who care about how this runs at scale.

• Sheldon Axler, Linear Algebra Done Right (Springer; 4th ed. freely readable online). The instructive contrast. Axler deliberately downplays row reduction, building the theory of linear maps and dimension without leaning on elimination — a vivid demonstration of the chapter's own warning that row reduction is a tool, not the point. Read Axler not for the algorithm but to see how much of linear algebra's structure stands independently of it. Best fit for: math majors who want to understand what is essential versus what is computational scaffolding.

Numerical and computational depth

• Lloyd N. Trefethen & David Bau, Numerical Linear Algebra (SIAM), Lectures 20–22. Where the clean textbook algorithm meets finite-precision reality. These lectures cover Gaussian elimination as $LU$ factorization, the necessity of partial pivoting for stability (our §4.4 Computational Note), and the operation counts. The honest, expert treatment of why pivoting matters and when elimination can still go wrong. Best fit for: readers heading toward scientific computing; the natural companion to our Chapter 38.
• William Press et al., Numerical Recipes, the chapter on "Solution of Linear Algebraic Equations." A pragmatic, code-first account of Gaussian elimination with pivoting, $LU$ decomposition, and when to use which — useful background for fleshing out your toolkit/linear_systems.py.

Free and open resources

• ★ 3Blue1Brown (Grant Sanderson), Essence of Linear Algebra, "Inverse matrices, column space and null space." The best visual companion. While the series has no episode titled "row reduction," this one shows why $A\mathbf{x}=\mathbf{b}$ has the solution structure it does (unique / none / infinite) in terms of what the transformation does to space — the geometric soul of §4.6–4.7. Watch it after working the hand examples.
• MIT OpenCourseWare 18.06, Linear Algebra (Gilbert Strang), Lectures 2–3 ("Elimination with Matrices," "Multiplication and Inverse Matrices"). Free video of Strang doing elimination at the board, including the elementary-matrix viewpoint of our §4.3. Lecture 2 is the ideal companion to §4.4. Search "MIT 18.06 elimination."
• Khan Academy, "Solving systems of equations with elimination" and "Matrix row operations." Gentle, exercise-driven reinforcement of the mechanics if you want more reps before the harder exercises.
• sympy documentation, Matrix.rref(). Since numpy deliberately offers no rref (floating point smears the exact zeros — see §4.5), sympy is the tool for exact reduced row echelon form. The docs show how to get the pivot columns alongside the reduced matrix, which is what your hand examples should match.

On the algorithm's history

• MacTutor History of Mathematics Archive (mathshistory.st-andrews.ac.uk) and Joseph F. Grcar, "Mathematicians of Gaussian Elimination," Notices of the AMS 58 (2011), 782–792. Grcar's article is the careful, well-sourced account that backs the chapter's [verify]-flagged history: Gauss's actual role (orbit computations, not invention), the much earlier Chinese Nine Chapters ("Fangcheng"), and the tangled origins of the "Gauss–Jordan" name (Wilhelm Jordan, and independently B.-I. Clasen). The honest version of the story, and a good model for treating historical attribution with care.

How to read alongside this book

If you are a CS / data-science reader: do the from-scratch coding exercises, keep Boyd–Vandenberghe open for the cost/stability themes, and skim Trefethen–Bau Lecture 20 to see how the pros implement it. If you are a math major: work the proof exercises (4.20–4.23), then read Axler to appreciate how much theory needs no elimination at all. If you are in physics / engineering: lean on Lay's worked examples and the two case studies, and connect the network-flow case study to circuit analysis (Kirchhoff's laws) in your other courses. Everyone should watch the 3Blue1Brown episode above — five minutes that make the unique/none/infinite trichotomy of §4.7 feel inevitable.