next up previous
Next: Trig interpolation Up: Interpolation Previous: Interpolation

Polynomial interpolation

If you have observed outcomes tex2html_wrap_inline129 at time or location tex2html_wrap_inline131 , how can you represent the general relationship between time and observation? There are several interpolation results - classes of functions to `fit' observed data. One key observation is

Weierstrass Approximation Theorem Let f be a continuous function on [a,b]. Then given any tex2html_wrap_inline133 , there exists a polynomial P on [a,b] such that tex2html_wrap_inline135 .

This suggests that polynomial approximation is a useful avenue for study. Consider, for example, fitting a polynomial through the points (0,10), (1,9), (2,0). Because there are three points, a quadratic is the appropriate polynomial to use. Let tex2html_wrap_inline137 . We have tex2html_wrap_inline139 . Solving, we find tex2html_wrap_inline141 . It is interesting to note that, even though these three points are monotonically decreasing, the polynomial fit is not - P(0.5)=10.5, bigger than the observed largest value.

More generally, simple fitting requires solution of a linear system for the coefficients:

displaymath143

A different approach with similar ends is to generate the Lagrange interpolation polynomial. For simplicity, consider a linear function at first, tex2html_wrap_inline145 , which is supposed to go through points tex2html_wrap_inline147 . Written as above, the 0-subscripted part of the polynomial should vanish at tex2html_wrap_inline149 , and vise versa. Plugging in, we find

displaymath151

More generally, the interpolation polynomial tex2html_wrap_inline153 is built from the factors tex2html_wrap_inline155 as

eqnarray33

EXERCISE: Compute the Lagrange polynomial through the three points used above.



E. Bruce Pitman
Fri Nov 27 18:33:05 EST 1998