Uploaded May 2021 | Updated September 2026, 1 week ago
We take the code from the last lecture and we spruce it up to handle high dimensional interpolation problems. Surprise! It takes no changes at all. This demonstrates the power of RBF interpolation, where the fundamental algorithm is unchanged even in high dimensional settings.
We specifically use the Gaussian RBF and the Exponential Dot Product Kernels to do the interpolations, and approximate the benchmark called Franke's Function.
Code Link: bitbucket.org/joelrosenfeld/rbf-and-kernel-interpolation/src/master
Music:
Come 2gether by Ooyy
Sunrise in Paris by Dan Henig
Guardians + Tek by Craig Hardgrove
We take the code from the last lecture and we spruce it up to handle high dimensional interpolation problems. Surprise! It takes no changes at all. This demonstrates the power of RBF interpolation, where the fundamental algorithm is unchanged even in high dimensional settings.
We specifically use the Gaussian RBF and the Exponential Dot Product Kernels to do the interpolations, and approximate the benchmark called Franke's Function.
Code Link: bitbucket.org/joelrosenfeld/rbf-and-kernel-interpolation/src/master
Music:
Come 2gether by Ooyy
Sunrise in Paris by Dan Henig
Guardians + Tek by Craig Hardgrove
