No video

Minimax Approximation and the Exchange Algorithm

  Рет қаралды 13,236

Dr. Will Wood

Dr. Will Wood

Күн бұрын

In this video we'll discuss minimax approximation. This is a method of approximating functions by minimisation of the infinity (uniform) norm. The exchange algorithm is an iterative method of finding the approximation which minimises the infinity norm.
FAQ : How do you make these animations?
Animations are mostly made in Apple Keynote which has lots of functionality for animating shapes, lines, curves and text (as well as really good LaTeX). For some of the more complex animations, I use the Manim library. Editing and voiceover work in DaVinci Resolve.
Supporting the Channel.
If you would like to support me in making free mathematics tutorials then you can make a small donation over at
www.buymeacoff...
Thank you so much, I hope you find the content useful.

Пікірлер: 27
@EdToml
@EdToml Жыл бұрын
Years ago, in my first real job, I need to approximate some experimentally derived curves. These curves were used to figure out if an turbine was performing as designed. So the error in the approximations needed to be predicable. I first tried least squared, but quickly realized, that even though this algorithm minimized the total error it did not minimize the maximum error. Hence it would sometimes pass engines that should have been rejected. I then tried min max. It was 'fun' determining the coefficients. This was in the late 1970s and computer power was quite limited. Min max ended up working quite well. its a very good solution when errors mater.
@emrekisi
@emrekisi 2 ай бұрын
Best explanations ever, it takes just 12 minutes and worth for every second. Thank you👍
@Darkev77
@Darkev77 Жыл бұрын
Beautifully and elegantly presented!
@tuongnguyen9391
@tuongnguyen9391 7 ай бұрын
this algorithm is used in filter design for electrical engineering, something call Remez algorithm
@The-Martian73
@The-Martian73 Жыл бұрын
Dude can't imagine how this did help me a lot, big thanks ❤
@yuankunzhu7230
@yuankunzhu7230 5 ай бұрын
First of all, i like this videos.🙂 because, your video is almost the only one which talking about remez algo that i have found. And, because, this "only one that i found" is very detailed, professional and with good examples. However, as a foreigner, more references(like slids or pdf file) are welcomed, and that will help me a lot.
@conando025
@conando025 Жыл бұрын
Lovely
@francescomazzoli389
@francescomazzoli389 Жыл бұрын
Your videos are fantastic, thanks a lot for putting these out.
@DrWillWood
@DrWillWood Жыл бұрын
thanks , i appreciate that!
@johnteran8889
@johnteran8889 10 ай бұрын
Beautiful video.
@kodirovsshik
@kodirovsshik Жыл бұрын
That is very useful, thank you for sharing. Lovely video!
@DrWillWood
@DrWillWood Жыл бұрын
Thanks!
@user-kf9xf9nd5s
@user-kf9xf9nd5s Жыл бұрын
Your vedio is very claer, and the examples provided helps me to understand the whole algorithm and min max approximation. Excellent.Thanks for your sharing.
@martinasdf4056
@martinasdf4056 Жыл бұрын
Awesome!
@General12th
@General12th Жыл бұрын
Hi Dr. Wood! This is nifty.
@andrasferencz7948
@andrasferencz7948 Жыл бұрын
Thanks
@DrWillWood
@DrWillWood Жыл бұрын
thank you so much! Appreciate the support!
@Focke42
@Focke42 Жыл бұрын
0:41 nom nom nomnom 😜Im sorry. The video was very informative👍
@Noissimsarm
@Noissimsarm Жыл бұрын
Is there a proof of the first theorem? Why should the minimal generate error terms like that?
@DrWillWood
@DrWillWood Жыл бұрын
there are proofs for everything here in MJD Powell's "Approximation theory and methods" including the characterisation theorem, the inequality for the bound on |h|, proof of convergence of the exchange algorithm etc. The characterisation theorem actually applies not just to polynomials but a wider class of functions which satisfy a set of conditions called the "Haar conditions", but didn't want to complicate the video too much! As for why the error terms behave like that I don't have a great intuition beyond a straight line where it's easy to verify by playing around a bit. I feel like it has something to do with the number of minima and maxima of a polynomial increasing with its degree but can't say much beyond that i'm afraid!
@hellomoto131313
@hellomoto131313 Жыл бұрын
I got lost when at 3:05 he called it a 4th order polynomial P(x), but you can see from the visual that P(x) must be at least a 5th degree polynomial, due to P'(x) = 0 for 4 different x values in the given interval (or you can notice that the end behaviors are approaching opposite infinities, i.e. odd degree =/= 4th degree). Am i missing something? I'm assuming "order" and "degree" mean the same thing for this polynomial context
@fork8972
@fork8972 2 ай бұрын
@DrWillWood 10:34 Should be 0.073, instead of 0.73.
@albertmagician8613
@albertmagician8613 11 ай бұрын
Once you realise that there is a background music, I can no longer follow the mathematics. I try to follow the music. Why do they that?
@user-pr6ed3ri2k
@user-pr6ed3ri2k Жыл бұрын
5:53 power of interpolation
@user-pr6ed3ri2k
@user-pr6ed3ri2k Жыл бұрын
1:13 idk like y=1/2 or smth
@pabloealvarez
@pabloealvarez Жыл бұрын
manim? regards from Chile!
@DrWillWood
@DrWillWood Жыл бұрын
Well spotted! Manim is used for the repeated iterations of the exchange algorithm. the rest is done in keynote!
The Vandermonde Matrix and Polynomial Interpolation
9:46
Dr. Will Wood
Рет қаралды 47 М.
A Swift Introduction to Geometric Algebra
44:23
sudgylacmoe
Рет қаралды 861 М.
Dad Makes Daughter Clean Up Spilled Chips #shorts
00:16
Fabiosa Stories
Рет қаралды 3,1 МЛН
Can This Bubble Save My Life? 😱
00:55
Topper Guild
Рет қаралды 86 МЛН
What are Digital Signatures? - Computerphile
10:17
Computerphile
Рет қаралды 331 М.
Approximations. The engineering way.
13:49
Zach Star
Рет қаралды 262 М.
The Revolutionary Genius Of Joseph Fourier
16:17
Dr. Will Wood
Рет қаралды 142 М.
Fast Inverse Square Root - A Quake III Algorithm
20:08
Nemean
Рет қаралды 5 МЛН
Deriving the Dirac Equation
16:34
Richard Behiel
Рет қаралды 95 М.
The Boundary of Computation
12:59
Mutual Information
Рет қаралды 1 МЛН
Padé Approximants
6:49
Dr. Will Wood
Рет қаралды 438 М.
Bijective Functions and the Continuum Hypothesis
9:49
Dr. Will Wood
Рет қаралды 14 М.
The BEST Way to Find a Random Point in a Circle | #SoME1 #3b1b
18:35