Save this video free

2NM4 Week 4: Interpolation and curve-fitting

Numerical Methods for Engineering · 1:17:52 · 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 lesson distinguishes exact interpolation from best-fit curve fitting, then develops polynomial and cubic-spline interpolation before extending the same linear-system framework to radial basis functions (RBFs). It connects Vandermonde matrices and Runge oscillations to practical alternatives, explains least-squares fitting with the pseudo-inverse and NumPy's polyfit, and shows why weights, measurement uncertainty, units, and model complexity matter when choosing a fit.

Key takeaways

Chapters

0:00 Interpolation Versus Curve Fitting and the Cost of Updates
4:00 Polynomial Interpolation: Uniqueness and Error Growth
8:08 Lagrange Basis Polynomials Build an Exact Interpolant
15:07 Lagrange Costs and Newton Divided-Difference Updates
19:30 Polynomial Coefficients, Vandermonde Systems, and Conditioning
25:08 Runge Phenomenon Motivates Piecewise Cubic Splines
31:17 Cubic Spline Continuity Produces a Sparse Banded System
35:17 RBF Interpolation as a Linear Combination of Radial Kernels
38:52 RBF Matrix Structure and Solver Choices
44:22 RBF Kernels, Epsilon, and Multidimensional Examples
51:12 Why RBFs Extend Interpolation Beyond One Dimension
59:01 Pseudo-Inverse and Least Squares for Overdetermined Data
1:04:21 NumPy polyfit on Noisy Polynomial Measurements
1:09:12 Choosing Polynomial Degree Beyond Residual Norm
1:15:07 Weighted Least Squares, Measurement Variance, and RBF Smoothing

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

Transcript excerpt

0:00 I'm going to move on. Interpolation and curve fitting. Uh I got to speed through this a little bit to make up for uh tomorrow's uh tomorrow's skipping. Okay. Um in both cases, what we're going to do is we're going to get a whole set of data and we're going to be asking like what is the general function interpolation and curve fitting kind of differ in that interpolation typically go through all of those data points and you want to know like given these data points, what is the value in between those? Right? you're interpolating between those guys. Um, typically you assume that there is no measurement error. If you have one guy here, another guy here, another guy here, you're going to fit a curve that roughly goes through all those guys. You're not going to do any kind of averaging. Um, there's no ambiguity in X and Y. There's no like duplicate X values, different Y values

0:48 for the same X. Um, typically they capture local behavior as opposed to curve fitting. Right? The magic's in the name fitting. It calculates the best fit for the data points. Doesn't necessarily traverse and match all of those individual data points, but it will give you kind of the general trend, right? Um, you can have ambiguity in XY pairs. You can have two values of X and different values in Y. It is more intended to be a global encapsulation of the data. Um, generally speaking, it is the generalization of interpolation. If you drill down the curve fit to the point where it has to be exact, right? Typically, you'll have a parameter, you have to be exact, then you will recover the interpolation. Does this sound

1:35 familiar to anybody who was here on Friday and learned about the pseudo

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.