Lecture 8 · Week 2· 17:20
Gaussian elimination
Row operations, row echelon form, back substitution.
Video: coming soon
The lecture (17:20) is not published yet. It will play right here as soon as it is on YouTube.
Saved in this browser only. No account needed.
In this lecture
- Why elimination
- Elementary row operations
- Row operations keep the solutions
- Row echelon form
- Forward elimination: an example
- Back substitution
- The algorithm in general
- When there is no solution
- Summary
Materials
Check yourself
Try it before you look
- Solve , , by Gaussian elimination, and check your answer.
- Is in row echelon form? If not, which single row operation brings it there?
Work it out on paper first. Then open the hint if you are stuck, and the answer to check.
1Hint
Everything you need is in Section 2.3 of the course book. Open it at page 14 of the chapter PDF; any theorem the question names is stated there, with an example worked the same way.
2Answer
- gives , gives , gives ; so , , . Check: , , .
- No: row 1's leading entry is to the right of row 2's. Swapping fixes it.
3How did it go?