Osculating polynomial interpolation
We may want to fit more than function values: we may also have derivative (first, or even higher) that we want to fit as well. In that case, we may need to require higher degree polynomials that incorporate the derivative information.
The easiest way to derive the interpolator is by modifying Newton's form of the interpolating polynomial just a little.
for each and .
The trick to computing Hermite polynomials is to ``trick'' the Newton interpolating polynomial into incorporating the true derivative information. As you no doubt recall, the derivative information is contained in the divided differences:
where
For each derivative in osculating interpolation that we intend to include, we simply include redundant point information. To fit a cubic, for example, and the two end points with point and derivative information, we would construct the following table:
Then the interpolating polynomial might be, for example,
Example: #9 asks us to verify that this polynomial meets the requirements of the osculating cubic....
The most important case we'll consider is one of osculating splines, generally cubic splines, that fit pairs of points and the derivatives at those points. Fitting two things on two ends gives four constraints, and that leads to a complete determination of the four parameters of a cubic.
Example: 1a:
The error information is included in the usual way for Hermite interpolation: it is estimated using the same formula as in theorem 3.3:
Example: #2a, and bound the error for the interval [8.3,8.6].
To incorporate derivatives at a certain point , one makes entries for in the table, and works the derivative information up the divided difference table. Simple!
Example: include the following second derivative information into the previous function: