At 33:36, why is there 2^n in the right hand side of the inequality related to the absolute value of the error function? Thanks. I thought it should be 2^{n-1} because max the absolute value of T~ on [-1, 1] is 1/2^{n-1}.
@dabrowsa At 33:33, you said you want to approximate a function. In the slide, you mentioned the target function as "C^{n+1} function f". What does that mean? Thanks.
The lecture is awesome! Thanks for sharing!
You're welcome!
I enjoyed this presentation
Amazing!
At 33:36, why is there 2^n in the right hand side of the inequality related to the absolute value of the error function? Thanks. I thought it should be 2^{n-1} because max the absolute value of T~ on [-1, 1] is 1/2^{n-1}.
But we're using T^~_{n+1}.
@dabrowsa At 33:33, you said you want to approximate a function. In the slide, you mentioned the target function as "C^{n+1} function f". What does that mean? Thanks.
C^{n+1} means it has n+1 continuous derivatives.
Great Lecture.
Can you suggest any good books
The video was based on Atkinson's Intro to Numerical Analysis
cs = poly_interp(ks,f(ks)) u use is not recognized to my programm :(
The code for poly_interp was given in an earlier video in the series.