divided difference table
In numerical work involving divided differences, whencomputing the divided differences of a tabulatedfunction, it is convenient to arrange the divideddifferences of a function in a table like so:
The arrangement of this table makes it easy to computethe divided differences. Also, once such a table hasbeen computed, one can read off the coefficients in thedivided difference interpolation formula as the topentries in the various columns.
To explain the computation, as well as to program it on acomputer, it is convenient to label the locations in ourtable with pairs of integers like so:
For convenience, introduce the notation todenote the entry of the difference table at location .Then, because of the recursion
we have
Using these formulae, we may systematically compute the divideddifference table as follows: The first and second column arejust the tabulation of our function, so we may write themdown immediately. Then we fill out the table one column at atime by using the formula.
Let us illustrate with a simple example. Consider the followingchoices for and :
We may write down our first two columns:
Now, we start filling in the next column, starting with .We take the difference of and and divide it by . Since
we have
Next we fill in the entry . We take the difference of and and divide it by . Since
we have
Finally, we fill in the entry . We take the difference of and and divide it by . Since
we have
Thus, we have constructed our difference table.The top entries in the columns are so,as per our earlier remark, the divided differenceinterpolation formula reads
Since is a second order polynomial, this interpolationto second order is exact. There is no remainder and, uponsimplifying the expression, we recover our original polynomial.