Evaluating numerical algorithm
Newton Backward Interpolation is used to estimate the value of a function at a given point when data points are tabulated at equal intervals. This method is particularly useful when you want to interpolate a value near the end of the data set by utilizing backward differences.
Where:
Let's say we are given the following data points:
| x | 24 | 28 | 32 | 36 | 40 |
|---|---|---|---|---|---|
| y | 28.06 | 30.19 | 32.75 | 34.94 | 40.00 |
We are tasked with finding where .
We construct the difference table by subtracting each value from its successor. The bottom row values (highlighted in emerald) form our primary backward difference vector :
| x | y | ∇y | ∇²y | ∇³y | ∇⁴y |
|---|---|---|---|---|---|
| 24 | 28.06 | - | - | - | - |
| 28 | 30.19 | 2.13 | - | - | - |
| 32 | 32.75 | 2.56 | 0.43 | - | - |
| 36 | 34.94 | 2.19 | -0.37 | -0.80 | - |
| 40 (x_n) | 40.00 (y_n) | 5.06 (∇y_n) | 2.87 (∇²y_n) | 3.24 (∇³y_n) | 4.04 (∇⁴y_n) |
Given target point , final base point , and uniform step size :
Governing polynomial expansion:
Substituting values ():
Thus, the interpolated value of at using Newton Backward Interpolation is approximately 33.27466.