Interpolation means for every node. Define the cardinal polynomials , which are well defined because the nodes are distinct. They have degree and satisfy . Hencebelongs to and interpolates. If two polynomials in interpolate the same data, their difference has distinct zeros but degree at most , so it is zero. This proves uniqueness. The phrase “of degree ” denotes membership in here: the actual degree may be smaller, for example for constant data.
Multiplying the Vandermonde matrix by a coefficient vector evaluates the polynomial at all nodes. If the result is zero, part (a)'s uniqueness for the zero interpolation data forces every coefficient to be zero. Thus the square matrix has trivial kernel and is invertible. Equivalently the interpolation map is a linear bijection between two spaces of dimension .
If is a node, both sides vanish and any works. Otherwise put and . The function has distinct zeros, at the nodes and at . Repeated application of Rolle's theorem gives an interior point where . As and , this gives . ThereforeThe distinct nodes and ensure , so the interior point is meaningful.
Every derivative of order of has magnitude at most . Pair the symmetric nodes and . For ,If there is an unpaired middle node, its factor has magnitude at most . Thus the full nodal product is at most , giving the stronger bound . In particular this implies the requestedThe bound tends to zero by factorial growth, so . This conclusion uses smoothness of this particular function and does not assert uniform convergence of equispaced interpolation for arbitrary continuous data.
Articles by others on the same topic
There are currently no matching articles.