Save this video free

2NM4 Week 2: Linear systems (direct)

Numerical Methods for Engineering · 2:08:23 · Watch on YouTube

Part of McMaster University ENGPHYS 2NM4. See all 5 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

The lecture develops direct methods for solving linear systems, connecting solvability and conditioning to matrix norms, sparsity, and computational cost. It explains Gaussian elimination, pivoting, diagonal dominance, and LU or PLU factorization, emphasizing that dense factorization scales as O(n^3), sparse structure can reduce costs, and reusable factors are preferable to explicitly forming A inverse.

Key takeaways

Chapters

0:00 Linear Systems as the Basic Numerical Problem
5:20 Why Matrix Properties Matter for Solving A x = b
9:08 Chairs-and-Tables Equations Illustrate Unique Solutions
16:16 Elimination and the Determinant for a 2 by 2 System
20:47 Singular Matrices, Infinite Solutions, and No Solutions
24:50 Geometric Meaning of Consistency and Linear Dependence
27:55 Vector L1, L2, and Infinity Norms
31:49 Matrix Norms Measure Transformation Strength
37:50 Near-Singularity Makes Linear Systems Ill-Conditioned
45:00 Conditioning Describes Distortion in Both Directions
49:00 Condition Number from Matrix Norms
59:47 Standard Matrix Types and Their Solver Properties
1:07:27 Sparsity and Finite-Element Matrix Structure
1:09:55 Banded, Tridiagonal, and Block Matrices
1:12:19 Big O Complexity and Matrix Operation Costs
1:16:52 Timing Matrix Operations and Limits of Complexity Estimates
1:22:37 Gaussian Elimination Converts Systems to Triangular Form
1:26:39 Augmented Matrices, Pivots, and Elimination Steps
1:31:15 Gaussian Elimination Cost and Gauss-Jordan Comparison
1:34:26 Why Zero and Small Pivots Require Row Permutations
1:43:07 Diagonal Dominance and Stable Pivot Choices
1:48:14 LU Decomposition Stores Elimination Multipliers
1:51:38 Reuse LU Factors for Multiple Right-Hand Sides
1:57:01 Sparse LU, Fill-In, and Why Not to Form A Inverse
2:02:05 NumPy, SciPy, and Practical Direct-Solver Guidance

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:00 linear solvers. Uh the whole art and science of numerical methods is going to be boiling things down and down and down and down to the point where it is trivial. Trivial on this level in this course means linear systems, right? Linear systems you guys should know at this point, but it's it's like for example the canonical solve, right? Anything that can be expressed as ax plus minus b is a linear transformation. A linear system looks like this. Solve for x is equal to b over a. Is anybody confused about this? Okay, good. In contrast, x^2 is nonlinear, right? Anybody know why that's nonlinear? It isn't a straight line on a graph. It

0:50 is quite literally like a line. Linear like a line, right? Specifically, it is the factor that you actually multiply these guys, right? There are transformation rules. There is like the mathematical definition of linearity. We're we're just kind of put that under there and like move on with our lives. I really like the line on a graph. Um s of x linear or no? No. Uh how about square root of x? Anybody think that's linear? Put up your hand. No. Right. Anything like that. How about x y? Is that linear in xy? Whoever thinks yes, keep your hand down. If you think no, raise your hand up. Good. We got some exercise. It is not linear. Technically, I think it's called bilinear, but we're we're not even going there. It is not linear for our purposes. It is not linear. Okay.

1:39 More complicated example is when you have multiple equations and unknowns. Ax plus b y is equal to e. I'm sorry about the repeating b and b there. blah blah blah. This is called a linear system. Do

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Numerical Methods for Engineering.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.