Hermite interpolation

In numerical analysis, Hermite interpolation, named after Charles Hermite, is a method of polynomial interpolation, which generalizes Lagrange interpolation. Lagrange interpolation allows computing a polynomial of degree less than n that takes the same value at n given points as a given function. Instead, Hermite interpolation computes a polynomial of degree less than n such that the polynomial and its first few derivatives have the same values at m (fewer than n) given points as the given function and its first few derivatives at those points. The number of pieces of information, function values and derivative values, must add up to ${\displaystyle n}$.

Hermite's method of interpolation is closely related to the Newton's interpolation method, in that both can be derived from the calculation of divided differences. However, there are other methods for computing a Hermite interpolating polynomial. One can use linear algebra, by taking the coefficients of the interpolating polynomial as unknowns, and writing as linear equations the constraints that the interpolating polynomial must satisfy. For another method, see Chinese remainder theorem § Hermite interpolation. For yet another method, see,^[1] which uses contour integration.

Statement of the problem

In the restricted formulation studied in,^[2] Hermite interpolation consists of computing a polynomial of degree as low as possible that matches an unknown function both in observed value, and the observed value of its first m derivatives. This means that n(m + 1) values

must be known. The resulting polynomial has a degree less than n(m + 1). (In a more general case, there is no need for m to be a fixed value; that is, some points may have more known derivatives than others. In this case the resulting polynomial has a degree less than the number of data points.)

Let us consider a polynomial P(x) of degree less than n(m + 1) with indeterminate coefficients; that is, the coefficients of P(x) are n(m + 1) new variables. Then, by writing the constraints that the interpolating polynomial must satisfy, one gets a system of n(m + 1) linear equations in n(m + 1) unknowns.

In general, such a system has exactly one solution. In,^[1] Charles Hermite used contour integration to prove that this is effectively the case here, and to find the unique solution, provided that the x_i are pairwise different. A method for computing the solution is described below.^[3]

Method

Simple case when all ${\displaystyle k=2}$

When using divided differences to calculate the Hermite polynomial of a function f, the first step is to copy each point m times. (Here we will consider the simplest case ${\displaystyle m=1}$ for all points.) Therefore, given ${\displaystyle n+1}$ data points ${\displaystyle x_{0},x_{1},x_{2},\ldots ,x_{n}}$, and values ${\displaystyle f(x_{0}),f(x_{1}),\ldots ,f(x_{n})}$ and ${\displaystyle f'(x_{0}),f'(x_{1}),\ldots ,f'(x_{n})}$ for a function ${\displaystyle f}$ that we want to interpolate, we create a new dataset

such that

Now, we create a divided differences table for the points ${\displaystyle z_{0},z_{1},\ldots ,z_{2n+1}}$. However, for some divided differences,

which is undefined. In this case, the divided difference is replaced by ${\displaystyle f'(z_{i})}$. All others are calculated normally.

A more general case when ${\displaystyle k>2}$

In the general case, suppose a given point ${\displaystyle x_{i}}$ has k derivatives. Then the dataset ${\displaystyle z_{0},z_{1},\ldots ,z_{N}}$ contains k identical copies of ${\displaystyle x_{i}}$. When creating the table, divided differences of ${\displaystyle j=2,3,\ldots ,k}$ identical values will be calculated as

For example,

etc.

A fast algorithm for the fully general case is given in.^[4] A a slower but more numerically stable algorithm is described in.^[5]

Example

Consider the function ${\displaystyle f(x)=x^{8}+1}$. Evaluating the function and its first two derivatives at ${\displaystyle x\in \{-1,0,1\}}$, we obtain the following data:

x	f(x)	f′(x)	f″(x)
−1	2	−8	56
0	1	0	0
1	2	8	56

Since we have two derivatives to work with, we construct the set ${\displaystyle \{z_{i}\}=\{-1,-1,-1,0,0,0,1,1,1\}}$. Our divided difference table is then:

and the generated polynomial is by taking the coefficients from the diagonal of the divided difference table, and multiplying the kth coefficient by ${\textstyle \prod _{i=0}^{k-1}(x-z_{i})}$, as we would when generating a Newton polynomial.

Quintic Hermite interpolation

The quintic Hermite interpolation based on the function (${\displaystyle f}$), its first (${\displaystyle f'}$) and second derivatives (${\displaystyle f''}$) at two different points (${\displaystyle x_{0}}$ and ${\displaystyle x_{1}}$) can be used for example to interpolate the position of an object based on its position, velocity and acceleration. The general form is given by

Error

Call the calculated polynomial H and original function f. Consider first the real-valued case. Evaluating a point ${\displaystyle x\in [x_{0},x_{n}]}$, the error function is

where c is an unknown within the range ${\displaystyle [x_{0},x_{N}]}$, K is the total number of data-points, and ${\displaystyle k_{i}}$ is the number of derivatives known at each ${\displaystyle x_{i}}$. The degree of the polynomial on the right is thus one higher than the degree bound for ${\displaystyle H(x)}$. Furthermore, the error and all its derivatives up to the ${\displaystyle k_{i}-1}$st order is zero at each node, as it should be.

In the complex case, as described for example on p. 360 in,^[5]

where the contour ${\displaystyle C}$ encloses ${\displaystyle z}$ and all the nodes ${\displaystyle x_{i}}$, and the node polynomial is ${\displaystyle w(z)=\prod _{i}(z-x_{i})^{k_{i}}}$.

See also

• Cubic Hermite spline
• Newton series, also known as finite differences
• Neville's schema
• Bernstein polynomials

References

External links

• Hermites Interpolating Polynomial at Mathworld