Nf1 - Newton's forward difference interpolation
Nf1 uses equally spaced function values to build a forward difference table, reconstruct a polynomial and estimate values between nodes. You will keep the starting point and spacing visible, recognise polynomial degree from differences, and distinguish an exact reconstruction from an approximate model.
Differences reveal a polynomial pattern
Can a short table tell you the shape of a curve? The values , at equally spaced inputs , do not increase by a constant amount. Their increases do: each increase grows by . That second-difference pattern points to a quadratic.
You already know
A polynomial of degree has a non-zero coefficient of . A table gives values at particular inputs, not automatically the rule between them. Keep the independent variable and the function value in separate columns.
Write a difference on the row where it starts. For example, the first difference on the row is the value at minus the value at .
Forward differences
For a fixed non-zero step ,
Apply the same operation again:
Higher differences are obtained by repeatedly subtracting neighbouring entries in the preceding difference column.
For equally spaced values of a polynomial of degree , the differences of order are constant, and higher differences vanish. For , that constant is non-zero. For example,
so differencing twice removes the changing part of a quadratic. This degree property is not separately printed in the formula booklet.
Worked example 1: a quadratic pattern
Question. Construct a difference table for at inputs , and give the lowest possible degree of an interpolating polynomial.
Plan. Subtract each entry from the next, repeating until the changing differences disappear.
Why this step? A constant non-zero second difference identifies quadratic behaviour; it is not the first differences that must be constant.
Answer. The lowest possible polynomial degree is .
Check. gives every listed value.
Change only the polynomial profile to , keeping the same input grid. One more difference column is needed.
Worked example 2: a cubic pattern
Question. Analyse the values at inputs .
Plan. Continue the difference table until a non-zero constant column appears.
Why this step? The second differences are not constant here; stopping one column early would misidentify the degree.
Answer. The lowest possible degree is .
Check. reproduces the five data values and has the expected cubic degree.
A spreadsheet can carry out the subtractions, but it must use the correct direction. With inputs in column A and values in B, the row- forward-difference formulae are:
| Cell | Formula | Meaning |
|---|---|---|
| C2 | Next value minus current value | |
| D2 | Next first difference minus current first difference | |
| E2 | Next second difference minus current second difference |
Fill down only while both required entries exist. A shorter column is expected; blank cells are not extra observations equal to zero.
Watch out
Wrong: say rounded observations are exactly quadratic because second differences are approximately equal.
Right: approximately constant differences support an approximate model. For example, changing the final value above to gives second differences , which are close, not equal.
Use a new table with a different lower-degree contribution.
Put the spacing into the interpolation formula
For inputs with values , the first entries of the successive difference columns are . Newton's formula uses those entries as coefficients of factors that vanish at earlier nodes.
The first correction contains ; the second contains both and . This allows a new term to fit a new node without spoiling the nodes already fitted.
Newton's forward difference interpolating polynomial
For equally spaced nodes , with , set
Then
Stop at order . The result has degree at most and interpolates those values. It reconstructs the function exactly if that function is a polynomial of degree at most ; otherwise it supplies an approximation.
In the formula booklet.
The booklet writes the equivalent factors using and powers of . The -form keeps the scaling together. For a quadratic, three selected nodes and the first two difference orders are enough.
Worked example 3: unit spacing
Question. Use Newton's formula to reconstruct the quadratic through .
Plan. Use , , and first entries , , .
Why this step? Every difference coefficient comes from the same starting row; mixing entries from different rows changes the polynomial.
Answer. .
Check. At , it gives .
Change only the grid spacing to , still sampling from the starting point .
Worked example 4: spacing two
Question. Reconstruct the quadratic through .
Plan. Use first differences , second difference , and .
Why this step? Increasing the step changes the differences and the scaled coordinate together. Using the new differences with would be inconsistent.
Answer. The same polynomial .
Check. It passes through all three new nodes. The larger second difference has not made the function more curved; the input spacing changed.
Check spacing before forming this table. Inputs are not equally spaced, so the forward formula cannot use all three together. Sometimes an equally spaced subset is available; otherwise use Lagrange's method in the next lesson.
Exam tip
Write , and first. If the independent variable is time , finish with a polynomial in , not an unexplained replacement variable.
Translate every output in the last table upwards by one, leaving the input grid fixed.
Watch out
Wrong: use with the spacing-two differences and . That treats a two-unit input change as one unit. Correct: , so .
Keep the input spacing and the difference coefficients consistent below.
Continue this lesson.
You’re previewing NovaLearn without an account. Create a free account to read the rest.
Create free account