Interpolation methods (1999)
paulbourke.net
Interpolation methods (1999)
1–6 of 6 posts
Re: Interpolation methods (1999)
#2Fascinating.
Re: Interpolation methods (1999)
#3Interestingly, I've never heard about cosine interpolation until now. I wonder why? Could it be that in a practical computation, cosine is in fact a polynomial itself and cosine interpolation is a kind of polynomial interpolation with extra steps? Does this also mean that we can "tame" approximating polynomials of high degree by introducing even more degrees? Fascinating.
The cosine interpolation simply ensures that the interpolated-function derivative is 0 at the control points. If anywhere in the sequence there was a point that is lower / higher than both its predecessors the downsides of this technique would become obvious.
Re: Interpolation methods (1999)
#4Re: Interpolation methods (1999)
#5Re: Interpolation methods (1999)
#6Interestingly, I've never heard about cosine interpolation until now. I wonder why? Could it be that in a practical computation, cosine is in fact a polynomial itself and cosine interpolation is a kind of polynomial interpolation with extra steps? Does this also mean that we can "tame" approximating polynomials of high degree by introducing even more degrees? Fascinating.
It's a trick. His example for cosine interpolation is misleading in the sense that the sequence of points' heights is oscillating. The cosine interpolation simply ensures that the interpolated-function derivative is 0 at the control points. If anywhere in the sequence there was a point that is lower / higher than both its predecessors the downsides of this technique would become obvious.