ChEn263 — Lecture 11

• Link to Course Notes

Lecture 11 - Gauss Elimination

• These notes cover the Gauss Elimination algorithm and how to code it. This lecture includes a high-level review of the algorithm, the index notation for the algorithm, and some tips about how to program it. I also work through examples of coding both forward elimination and backward substitution–the two key pieces of the algorithm.

• Handwritten Notes
• Video Notes
• Forward elimination example code
• Backward substitution example code

Examples

This video contains an extra practice example coding the entire Gauss Elimination Algorithm. If you are struggling with the homework, try the example below first, and then watch the video for the answer. It will help you significantly, if you try the problem before watching the video.

• Practice - Gauss Elimination (no key provided)

Homework

• Note that the codes given above are for your learning and are meant to help you know enough to finish the assignment. However, they are built so that you cannot copy and paste from them. Please learn the algorithms, and don’t just copy the codes. You will increase your learning significantly by coding it for yourself on this homework.
• HW 11 Problem Set
• HW 11 Supplementary Files (Data for problem 3)