You are viewing a public preview
Sign in to save your progress, do assignments, join discussions and get feedback.
Flashcards · Linear systems
8 wordsa₁x₁ + … + aₙxₙ = b with fixed real coefficients and b; no products of unknowns, powers or functions of them.
The coefficient matrix with the right-hand side appended as an extra column; column order must match the order of the unknowns.
Rᵢ ↔ Rⱼ (swap), Rᵢ ← cRᵢ with c ≠ 0 (scale), Rᵢ ← Rᵢ + cRⱼ (replace). They never change the solution set; multiplying by 0 is not allowed.
The leading nonzero entry of a nonzero row. Forward elimination creates zeros below each pivot.
Zero rows at the bottom and pivots moving strictly to the right as you go down. Reduced form: every pivot is 1 and is the only nonzero entry in its column.
A row [0 … 0 | c] with c ≠ 0 means 0 = c; the system has no solution.
Variables in pivot columns are basic; the others are free and can take any value. A unique solution needs a pivot in every variable column.
Ax = 0. Always has x = 0; has nonzero solutions exactly when some variable is free (always, if there are fewer equations than unknowns).
If xₚ solves Ax = b, all solutions are xₚ + z with Az = 0.
Work through Section 1 of Lab 1 (Linear Algebra with NumPy, MFDS_Lab1_Linear_Algebra.ipynb), attached to the Part I materials lesson at the start of this part.