Birkhoff interpolation explained

In mathematics, Birkhoff interpolation is an extension of polynomial interpolation. It refers to the problem of finding a polynomial

P(x) of degree d such that only certain derivatives have specified values at specified points:P ^{(n _{i)}} (x _{i)} = y _{i} for i =1 ,\ldots,d, where the data points (x _{i,y} _{i)} and the nonnegative integers n _{i} are given. It differs from Hermite interpolation in that it is possible to specify derivatives of P(x) at some points without specifying the lower derivatives or the polynomial itself. The name refers to George David Birkhoff, who first studied the problem in 1906.^[1]

Existence and uniqueness of solutions

In contrast to Lagrange interpolation and Hermite interpolation, a Birkhoff interpolation problem does not always have a unique solution. For instance, there is no quadratic polynomial

P(x) such that P( -1 ) = P( 1 ) =0 and P ^{(1)} ( 0 ) =1 . On the other hand, the Birkhoff interpolation problem where the values of P ^{(1)} ( -1 ), P( 0 ) and P ^{(1)} ( 1 ) are given always has a unique solution.^[2]

An important problem in the theory of Birkhoff interpolation is to classify those problems that have a unique solution. Schoenberg^[3] formulates the problem as follows. Let

d denote the number of conditions (as above) and let k be the number of interpolation points. Given a d x k matrix E , all of whose entries are either 0 or 1 , such that exactly d entries are 1 , then the corresponding problem is to determine P(x) such thatP ^{(j)} (x _{i)} = y _{i,j} \forall (i,j) / e _{ij} = 1 The matrix E is called the incidence matrix. For example, the incidence matrices for the interpolation problems mentioned in the previous paragraph are:\begin{pmatrix} 1 & 0 & 0 \ 0 & 1 & 0 \ 1 & 0 & 0 \end{pmatrix} and \begin{pmatrix} 0 & 1 & 0 \ 1 & 0 & 0 \ 0 & 1 & 0 \end{pmatrix}. Now the question is: Does a Birkhoff interpolation problem with a given incidence matrix E have a unique solution for any choice of the interpolation points?

The case with

k =2 interpolation points was tackled by George Pólya in 1931.^[4] Let S _{m} denote the sum of the entries in the first m columns of the incidence matrix:S _{m} = \sum ^{k} _{i =1} \sum ^{m} _{j =1} e _{ij} . Then the Birkhoff interpolation problem with k =2 has a unique solution if and only if S _{m\geqslant} m \forall m . Schoenberg showed that this is a necessary condition for all values of k .

Some examples

Consider a differentiable function

f(x) on [a,b] , such that f(a) = f(b) . Let us see that there is no Birkhoff interpolation quadratic polynomial such that P ^{(1)} (c) = f ^{(1)} (c) where c = (a + b)/(2) : Since f(a) = f(b) , one may write the polynomial as P(x) = A(x - c) ^{2+B} (by completing the square) where A,B are merely the interpolation coefficients. The derivative of the interpolation polynomial is given by P ^{(1)} (x) =2 A(x - c) ^{2} . This implies P ^{(1)} (c) =0 , however this is absurd, since f ^{(1)} (c) is not necessarily 0 . The incidence matrix is given by:\begin{pmatrix} 1 & 0 & 0 \ 0 & 1 & 0 \ 1 & 0 & 0 \end{pmatrix} _{3 x 3}

Consider a differentiable function

f(x) on [a,b] , and denote x _{0=a,x} _{2=b} with x _{1\in[a,b]} . Let us see that there is indeed Birkhoff interpolation quadratic polynomial such that P(x _{1)=f(x} _{1)} and P ^{(1)} (x ^{( 1 )} _{0 ) = f} (x ^{( 1 )} _{0 ),P} (x ^{( 1 )} _{2 ) = f} (x _{2)} . Construct the interpolating polynomial of f ^{(1)} (x) at the nodes x _{0,x} _{2} , such that \displaystyle P _{1(x)} = (f ^{( 1 )} (x ^{( 1 )} _{2 ) - f} (x _{0)})/(x _{2-x} _{0}) (x - x ^{( 1 )} _{0 ) + f} (x _{0)} . Thus the polynomial : \displaystyle P _{2(x)} = f(x _{1)} + \int ^{xP} _{1 (t) d t} is the Birkhoff interpolating polynomial. The incidence matrix is given by:\begin{pmatrix} 0 & 1 & 0 \ 1 & 0 & 0 \ 0 & 1 & 0 \end{pmatrix} _{3 x 3}

Given a natural number

N , and a differentiable function f(x) on [a,b] , is there a polynomial such that: P(x _{0)=f(x} _{0)} and P ^{(1)} (x ^{( 1 )} _{i) = f} (x _{i)} for i =1 , … ,N with x _{0,x} _{1, … ,x} _{N\in[a,b]} ? Construct the Lagrange/Newton polynomial (same interpolating polynomial, different form to calculate and express them) P _{N-1} (x) that satisfies P _{N-1} (x ^{( 1 )} _{i) = f} (x _{i)} for i =1 , … ,N , then the polynomial \displaystyle P _{N(x)} = f(x _{0)} + \int ^{x} _{x _{0}} P _{N-1} (t) d t is the Birkhoff interpolating polynomial satisfying the above conditions. The incidence matrix is given by:\begin{pmatrix} 1 & 0 & 0 & … & 0 \ 0 & 1 & 0 & … & 0 \ \vdots & \vdots & \vdots & \ddots & \vdots \ 0 & 1 & 0 & … & 0 \ \end{pmatrix} _{N x}

Given a natural number

N , and a 2 N differentiable function f(x) on [a,b] , is there a polynomial such that: P ^{(k)} (a) = f ^{(k)} (a) and P ^{(k)} (b) = f ^{(k)} (b) for k =0 , 2 , … , 2 N ? Construct P _{1(x)} as the interpolating polynomial of f(x) at x = a and x = b , such that P _{1 (x) = (f ^{(2N)} (b) - f ^{(2N)} (a))/(b - a)} (x - a) + f ^{(2N)} (a) . Define then the iterates \displaystyle P _{k+2} (x) = (f ^{(2N-2k)} (b) - f ^{(2N-2k)} (a))/(b - a) (x - a) + f ^{(2N-2k)} (a) + \int ^{t} _{a} P _{k(s) ds dt} . Then P _{2N+1} (x) is the Birkhoff interpolating polynomial. The incidence matrix is given by:\begin{pmatrix} 1 & 0 & 1 & 0 … \ 1 & 0 & 1 & 0 … \ \end{pmatrix} _{2 x}

References

1. Birkhoff . George David . 1906 . General mean value and remainder theorems with applications to mechanical differentiation and quadrature . Transactions of the American Mathematical Society . en . 7 . 1 . 107–136 . 10.1090/S0002-9947-1906-1500736-1 . 0002-9947. free .
2. Web site: American Mathematical Society . 2022-05-19 . American Mathematical Society . en.
3. Schoenberg . I. J . 1966-12-01 . On Hermite-Birkhoff interpolation . Journal of Mathematical Analysis and Applications . en . 16 . 3 . 538–543 . 10.1016/0022-247X(66)90160-0 . 0022-247X. free .
4. Pólya . G. . 1931 . Bemerkung zur Interpolation und zur Näherungstheorie der Balkenbiegung . ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik . de . 11 . 6 . 445–449 . 10.1002/zamm.19310110620.