Clearly the interpolating polynomial has zero error at the interpolating points, but we now want to investigate the behaviour of the pointwise error, e(x)=f(x)-p(x), at all points. This is given by the following theorem.
Theorem 1736
Let f(n+1) exist on [a,b] and let p be the
polynomial for which p(xi)=f(xi) at the n+1 distinct points
in [a,b]. Then, for each x in [a,b] there
exists a point
(which depends on x) in the interval
![]()
![]()
[Note that the order of points is not significant and that this form is
very similar to the Taylor remainder
. The proof is also similar.]
Corollary 1742
If f is a polynomial of degree at most n then the interplating polynomial of degree n is f.
Example Find a bound on the error in approximating e-x on
[0.0.2] by its interpolating quadratic at 0, 0.1, 0.2.
The error is given byfor some
(1) . We have
We use elementary calculus to find bounds for x(x-0.1)(x-0.2)=x3-0.3x2+0.02x. To find the extrema
The values at these extrema are
Putting these two results into (
), we obtain the bound
so we obtain 4 figure accuracy.
It is interesting to note that 4-figure tables give the value of the function at a tabular interval of 0.01, which is required to give the correct answer using linear interpolation. With quadratic interpolation, over this part of the table at least, the tabular interval only needs to be 0.1!
To see how good the error estimate is in this case, we evaluate the interpolating quadratic using the Lagrange formula as
As we saw above, the maximum error occurs at
0.157735 or 0.042265.
Now
The true value is 0.85408 correct to 5D, so the error bound is very precise in this case.
If we use a Taylor approximation of order 2 about 0, the pointwise error is
With f(x)=e-x the error is
, which in the interval [0,0.2] is bounded by
. The actual error at x=0.157735 is