📘 Lecture 20 — Newton’s Backward Difference Interpolation Formula
📖 Overview: This lecture introduces Newton’s backward difference interpolation formula, which is used for interpolating the value of a function near the end of a table of values and for extrapolating a short distance forward. It is derived using the backward difference operator and is also known as the Newton-Gregory backward difference interpolation formula. The lecture includes the derivation of the formula and several worked examples demonstrating its application.
🗂️ Topics Covered
The lecture covers the definition and purpose of Newton’s backward difference interpolation formula, its derivation using the shift operator E and the backward difference operator ∇, the binomial expansion that yields the formula, and the expression for the parameter p. It then provides three detailed examples that show how to construct backward difference tables and apply the formula to estimate function values at specific points, such as f(7.5), sales for the year 1979, and f(1.45).
📝 Lecture Summary
Newton’s Backward Difference Interpolation Formula
The Newton’s backward difference interpolation formula is used to find the value of a function (y = f(x)) near the end of a table of values or to extrapolate a value forward. Let the function take values (f(x_n), f(x_n - h), f(x_n - 2h), \ldots, f(x_0)) at equally spaced points (x_n, x_n - h, x_n - 2h, \ldots, x_0). To evaluate the function at ((x_n + ph)), where p is any real number, the shift operator (E) is used. The derivation begins with the relation (f(x_n + ph) = E^p f(x_n) = (E^{-1})^{-p} f(x_n) = (1 - \nabla)^{-p} f(x_n)). Applying the binomial expansion yields the formula.
🔑 Definition — Newton’s backward difference interpolation formula: (f(x_n + ph) = f(x_n) + p\nabla f(x_n) + \frac{p(p+1)}{2!} \nabla^2 f(x_n) + \frac{p(p+1)(p+2)}{3!} \nabla^3 f(x_n) + \cdots + \frac{p(p+1)\cdots(p+n-1)}{n!} \nabla^n f(x_n) + \text{Error}). This formula is also known as the Newton-Gregory backward difference interpolation formula. If (r+1) terms are retained, we obtain a polynomial of degree (r) agreeing with (f(x)) at (x_n, x_{n-1}, \ldots, x_{n-r}).
📐 Formula: (y_x = y_n + p\nabla y_n + \frac{p(p+1)}{2!} \nabla^2 y_n + \frac{p(p+1)(p+2)}{3!} \nabla^3 y_n + \cdots + \frac{p(p+1)\cdots(p+n-1)}{n!} \nabla^n y_n + \text{Error}), where (p = \frac{x - x_n}{h}).
Example 1
Problem: For the following table of values, estimate (f(7.5)).
| x | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
|---|---|---|---|---|---|---|---|---|
| f(x) | 1 | 8 | 27 | 64 | 125 | 216 | 343 | 512 |
Solution: The value to be interpolated is at the end of the table, so Newton’s backward interpolation formula is appropriate. First, construct the backward difference table.
| x | y=F(x) | ∇y | ∇²y | ∇³y | ∇⁴y |
|---|---|---|---|---|---|
| 1 | 1 | ||||
| 2 | 8 | 7 | |||
| 3 | 27 | 19 | 12 | ||
| 4 | 64 | 37 | 18 | 6 | |
| 5 | 125 | 61 | 24 | 6 | 0 |
| 6 | 216 | 91 | 30 | 6 | 0 |
| 7 | 343 | 127 | 36 | 6 | 0 |
| 8 | 512 | 169 | 42 | 6 | 0 |
Since (3^{\text{rd}}) and higher order differences are zero or constant, the required formula is (y_x = y_n + p\nabla y_n + \frac{p(p+1)}{2!} \nabla^2 y_n + \frac{p(p+1)(p+2)}{3!} \nabla^3 y_n). Here, (x_n = 8, y_n = 512, h = 1). So, (p = \frac{x - x_n}{h} = \frac{7.5 - 8.0}{1} = -0.5). From the table, (\nabla y_n = 169, \nabla^2 y_n = 42, \nabla^3 y_n = 6).
📌 Example: (y_{7.5} = 512 + (-0.5)(169) + \frac{(-0.5)(0.5)}{2}(42) + \frac{(-0.5)(0.5)(1.5)}{6}(6)) (y_{7.5} = 512 - 84.5 - 5.25 - 0.375 = 421.875)
Example 2
Problem: The sales for the last five years is given in the table below. Estimate the sales for the year 1979.
| Year | 1978 | 1979 | 1980 | 1981 | 1982 |
|---|---|---|---|---|---|
| Sales | ? | ? | 40 | 43 | 48 |
Solution: Let the year 1978 correspond to x=0. The backward difference table is:
| x | Year | y | ∇y | ∇²y | ∇³y | ∇⁴y |
|---|---|---|---|---|---|---|
| 0 | 1978 | 35 | 5 | |||
| 1 | 1979 | ? | ||||
| 2 | 1980 | 43 | 5 | 0 | ||
| 3 | 1981 | 48 | 5 | 0 | 0 | |
| 4 | 1982 | 52 | 4 | -1 | -1 | -1 |
| 5 | 1983 | 57 | 5 | 1 | 2 | 3 |
Here, (x_n = 5, y_n = 57, h = 1). For the year 1979, (x = 1), so (p = \frac{1 - 5}{1} = -4). Using (y_x = y_n + p\nabla y_n + \frac{p(p+1)}{2!} \nabla^2 y_n + \frac{p(p+1)(p+2)}{3!} \nabla^3 y_n + \frac{p(p+1)(p+2)(p+3)}{4!} \nabla^4 y_n), with (\nabla y_n = 5, \nabla^2 y_n = 1, \nabla^3 y_n = 2, \nabla^4 y_n = 5), we get: (y_{1979} = 57 + (-4)(5) + \frac{(-4)(-3)}{2}(1) + \frac{(-4)(-3)(-2)}{6}(2) + \frac{(-4)(-3)(-2)(-1)}{24}(5)) (y_{1979} = 57 - 20 + 6 - 8 + 5 = 40). Therefore, sales for 1979 are estimated to be 40.
💡 Why this matters: This example shows how the formula can be used for extrapolation (estimating a value before the first data point in the table), not just interpolation near the end.
Example 3
Problem: Consider the following table of values. Use Newton’s Backward Difference Formula to estimate the value of (f(1.45)).
| x | 1 | 1.1 | 1.2 | 1.3 | 1.4 | 1.5 |
|---|---|---|---|---|---|---|
| F(x) | 2 | 2.1 | 2.3 | 2.7 | 3.5 | 4.5 |
Solution: The backward difference table is:
| x | y=F(x) | ∇y | ∇²y | ∇³y | ∇⁴y | ∇⁵y |
|---|---|---|---|---|---|---|
| 1 | 2 | |||||
| 1.1 | 2.1 | 0.1 | ||||
| 1.2 | 2.3 | 0.2 | 0.1 | |||
| 1.3 | 2.7 | 0.4 | 0.2 | 0.1 | ||
| 1.4 | 3.5 | 0.8 | 0.4 | 0.2 | 0.1 | |
| 1.5 | 4.5 | 1.0 | 0.2 | -0.2 | -0.4 | -0.5 |
Here, (x_n = 1.5, y_n = 4.5, h = 0.1). For (x = 1.45), (p = \frac{1.45 - 1.5}{0.1} = -0.5). Values from the table: (\nabla y_n = 1, \nabla^2 y_n = 0.2, \nabla^3 y_n = -0.2, \nabla^4 y_n = -0.4, \nabla^5 y_n = -0.5). Using the full formula up to the 5th difference: (y_{1.45} = 4.5 + (-0.5)(1) + \frac{(-0.5)(-0.5+1)}{2!}(0.2) + \frac{(-0.5)(-0.5+1)(-0.5+2)}{3!}(-0.2) + \frac{(-0.5)(-0.5+1)(-0.5+2)(-0.5+3)}{4!}(-0.4) + \frac{(-0.5)(-0.5+1)(-0.5+2)(-0.5+3)(-0.5+4)}{5!}(-0.5)) (y_{1.45} = 4.5 + (-0.5)(1) + \frac{(-0.5)(0.5)}{2}(0.2) + \frac{(-0.5)(0.5)(1.5)}{6}(-0.2) + \frac{(-0.5)(0.5)(1.5)(2.5)}{24}(-0.4) + \frac{(-0.5)(0.5)(1.5)(2.5)(3.5)}{120}(-0.5)) (y_{1.45} = 4.5 - 0.5 - 0.025 + 0.0125 + 0.015625 + 0.068359 = 4.07148)
⭐ Key Takeaways
Newton’s backward difference interpolation formula is the essential tool for estimating function values when the point of interest lies near the end of a tabulated dataset. The parameter (p) must be correctly computed as ((x - x_n)/h), where (x_n) is the last tabulated point. The accuracy of the interpolation depends on the order of differences included, and while the formula uses backward differences, its application mirrors that of its forward counterpart. It is also effective for extrapolating a short distance backward from the table’s last point, as demonstrated in a sales estimation example.
🧠 Quick Revision Questions
- When should Newton’s backward difference interpolation formula be used instead of the forward difference formula?
- What is the formula for the parameter (p) in Newton’s backward interpolation formula, and what does each term represent?
- In Example 1, how does knowing that 3rd order differences are constant simplify the formula used?
- If you have data points at x = 0, 1, 2, 3 and want to estimate f(2.5), what is the value of (p) assuming you use the backward formula?
- What is the primary distinction between interpolation and extrapolation in the context of Newton’s backward formula?
📘 Lecture 21 — Lagrange’s Interpolation Formula
📖 Overview: This lecture presents Lagrange’s interpolation formula, which is used to construct an interpolating polynomial when the values of the independent variable (x) are not equally spaced. Unlike Newton’s forward/backward formulas, Lagrange’s method works for any spacing. The lecture derives the formula step-by-step, introduces the Lagrange basis polynomials (L_k(x)), and provides worked examples.
🗂️ Topics Covered
The lecture covers the motivation for Lagrange’s interpolation when data points are not equally spaced, the derivation of the polynomial form using coefficients (a_k), the compact form using Lagrange basis polynomials (L_k(x)) and the Kronecker delta (\delta_{ij}), the alternative product notation using (\Pi(x)) and its derivative, and finally two fully worked numerical examples showing how to compute the polynomial and evaluate it at a given point.
📝 Lecture Summary
Lagrange’s Interpolation Formula Derivation
Newton’s interpolation formulas developed earlier can be used only when the values of the independent variable (x) are equally spaced and the differences of (y) ultimately become small. If the values of (x) are not given at equidistant intervals, we have the basic formula associated with the name of Lagrange.
Let (y = f(x)) be a function that takes the values (y_0, y_1, \ldots, y_n) corresponding to (x_0, x_1, \ldots, x_n). Since there are ((n+1)) values of (y), we can represent the function (f(x)) by a polynomial of degree (n). We write this polynomial in the form:
[ y = f(x) = a_0 (x - x_1)(x - x_2)\cdots(x - x_n) + a_1 (x - x_0)(x - x_2)\cdots(x - x_n) + \cdots + a_n (x - x_0)(x - x_1)\cdots(x - x_{n-1}) ]
Here, the coefficients (a_k) are chosen so that this equation is satisfied by the ((n+1)) pairs ((x_i, y_i)). Substituting (x = x_0) gives:
[ y_0 = a_0 (x_0 - x_1)(x_0 - x_2)\cdots(x_0 - x_n) ]
Therefore:
[ a_0 = \frac{y_0}{(x_0 - x_1)(x_0 - x_2)\cdots(x_0 - x_n)} ]
Similarly, we obtain:
[ a_1 = \frac{y_1}{(x_1 - x_0)(x_1 - x_2)\cdots(x_1 - x_n)} ]
And in general:
[ a_i = \frac{y_i}{(x_i - x_0)(x_i - x_1)\cdots(x_i - x_{i-1})(x_i - x_{i+1})\cdots(x_i - x_n)} ]
And:
[ a_n = \frac{y_n}{(x_n - x_0)(x_n - x_1)\cdots(x_n - x_{n-1})} ]
Substituting the values of (a_0, a_1, \ldots, a_n) back into the polynomial gives Lagrange’s interpolation formula:
[ y = f(x) = \frac{(x - x_1)(x - x_2)\cdots(x - x_n)}{(x_0 - x_1)(x_0 - x_2)\cdots(x_0 - x_n)} y_0 + \frac{(x - x_0)(x - x_2)\cdots(x - x_n)}{(x_1 - x_0)(x_1 - x_2)\cdots(x_1 - x_n)} y_1 + \cdots + \frac{(x - x_0)(x - x_1)\cdots(x - x_{i-1})(x - x_{i+1})\cdots(x - x_n)}{(x_i - x_0)(x_i - x_1)\cdots(x_i - x_{i-1})(x_i - x_{i+1})\cdots(x_i - x_n)} y_i + \cdots ]
This formula can be used whether the values (x_0, x_1, \ldots, x_n) are equally spaced or not.
🔑 Definition — Lagrange Basis Polynomials: The formula can be written in compact form as:
[ y = f(x) = L_0(x) y_0 + L_1(x) y_1 + \cdots + L_n(x) y_n = \sum_{k=0}^n L_k(x) y_k = \sum_{k=0}^n L_k(x) f(x_k) ]
where
[ L_i(x) = \frac{(x - x_0)(x - x_1)\cdots(x - x_{i-1})(x - x_{i+1})\cdots(x - x_n)}{(x_i - x_0)(x_i - x_1)\cdots(x_i - x_{i-1})(x_i - x_{i+1})\cdots(x_i - x_n)} ]
Properties of Lagrange Basis Polynomials and Alternative Form
We can easily observe that (L_i(x_i) = 1) and (L_i(x_j) = 0) for (i \neq j). This is represented using the Kronecker delta notation:
[ L_i(x_j) = \delta_{ij} = \begin{cases} 1, & \text{if } i = j \ 0, & \text{if } i \neq j \end{cases} ]
💡 Why this matters: This property ensures that the polynomial passes exactly through each data point ((x_i, y_i)).
We can also introduce the product notation:
[ \Pi(x) = \prod_{i=0}^n (x - x_i) = (x - x_0)(x - x_1)\cdots(x - x_n) ]
Its derivative (\Pi'(x)) is a sum of ((n+1)) terms, each missing one factor. We define:
[ P_k(x) = \prod_{i \neq k} (x - x_i) ]
which is the same as (\Pi(x)) except the factor ((x - x_k)) is absent. Then:
[ \Pi'(x) = P_0(x) + P_1(x) + \cdots + P_n(x) ]
When (x = x_k), all terms in the above sum vanish except (P_k(x_k)). Hence:
[ \Pi'(x_k) = P_k(x_k) = (x_k - x_0)\cdots(x_k - x_{k-1})(x_k - x_{k+1})\cdots(x_k - x_n) ]
Therefore:
[ L_k(x) = \frac{P_k(x)}{P_k(x_k)} = \frac{P_k(x)}{\Pi'(x_k)} = \frac{\Pi(x)}{(x - x_k) \Pi'(x_k)} ]
Finally, Lagrange’s interpolation polynomial of degree (n) can be written as:
[ y(x) = f(x) = \sum_{k=0}^n \frac{\Pi(x)}{(x - x_k) \Pi'(x_k)} f(x_k) = \sum_{k=0}^n L_k(x) f(x_k) = \sum_{k=0}^n L_k(x) y_k ]
Example 1: Fitting a Polynomial and Finding y(5)
Find Lagrange’s interpolation polynomial fitting the points (y(1) = -3, y(3) = 0, y(4) = 30, y(6) = 132). Hence find (y(5)).
Solution: Using Lagrange’s interpolation formula:
[ y(x) = f(x) = \frac{(x-3)(x-4)(x-6)}{(1-3)(1-4)(1-6)} (-3) + \frac{(x-1)(x-4)(x-6)}{(3-1)(3-4)(3-6)} (0) + \frac{(x-1)(x-3)(x-6)}{(4-1)(4-3)(4-6)} (30) + \frac{(x-1)(x-3)(x-4)}{(6-1)(6-3)(6-4)} (132) ]
On simplification, we get:
[ y(x) = \frac{1}{10}(-5x^3 + 135x^2 - 460x + 300) = \frac{1}{2}(-x^3 + 27x^2 - 92x + 60) ]
This is the required Lagrange’s interpolation polynomial. Now, (y(5) = 75).
Example 2: Evaluating f(3)
Given the following data, evaluate (f(3)) using Lagrange’s interpolating polynomial.
| (x) | 1 | 2 | 5 |
|---|---|---|---|
| (f(x)) | 1 | 4 | 10 |
Solution: Using Lagrange’s formula:
[ f(3) = \frac{(3-2)(3-5)}{(1-2)(1-5)}(1) + \frac{(3-1)(3-5)}{(2-1)(2-5)}(4) + \frac{(3-1)(3-2)}{(5-1)(5-2)}(10) ]
[ f(3) = \frac{(1)(-2)}{(-1)(-4)}(1) + \frac{(2)(-2)}{(1)(-3)}(4) + \frac{(2)(1)}{(4)(3)}(10) = \frac{-2}{4}(1) + \frac{-4}{-3}(4) + \frac{2}{12}(10) ]
[ f(3) = -0.5 + \frac{16}{3} + \frac{20}{12} = -0.5 + 5.3333 + 1.6667 = 6.49999 \approx 6.5 ]
Example 3: Finding the Interpolating Polynomial
Find the interpolating polynomial for the data using Lagrange’s formula:
| (x) | 1 | 2 | -4 |
|---|---|---|---|
| (f(x)) | 3 | -5 | -4 |
Solution: Using Lagrange’s formula:
[ y(x) = \frac{(x-2)(x+4)}{(1-2)(1+4)}(3) + \frac{(x-1)(x+4)}{(2-1)(2+4)}(-5) + \frac{(x-1)(x-2)}{(-4-1)(-4-2)}(-4) ]
[ y(x) = -\frac{3}{5}(x^2+2x-8) - \frac{5}{6}(x^2+3x-4) - \frac{4}{30}(x^2-3x+2) ]
[ y(x) = -\frac{3}{5}x^2 - \frac{6}{5}x + \frac{24}{5} - \frac{5}{6}x^2 - \frac{15}{6}x + \frac{20}{6} - \frac{4}{30}x^2 + \frac{12}{30}x - \frac{8}{30} ]
Combining coefficients:
[ y(x) = \left(-\frac{3}{5} - \frac{5}{6} - \frac{4}{30}\right)x^2 + \left(-\frac{6}{5} - \frac{15}{6} + \frac{12}{30}\right)x + \left(\frac{24}{5} + \frac{20}{6} - \frac{8}{30}\right) ]
[ y(x) = -\frac{47}{30}x^2 - \frac{33}{10}x + \frac{118}{15} ]
Which is the required polynomial.
⭐ Key Takeaways
Lagrange’s interpolation formula is a fundamental method for constructing an interpolating polynomial that works for any set of data points, regardless of whether the (x)-values are equally spaced. The key to the formula is the set of Lagrange basis polynomials (L_k(x)), which are designed to be exactly 1 at (x = x_k) and 0 at all other data points, ensuring the polynomial passes through all given points. The formula is completely general for ((n+1)) data points producing a polynomial of degree (n). For the exam, remember the compact sum form (y(x) = \sum L_k(x) y_k), the Kronecker delta property ((L_i(x_j) = \delta_{ij})), and be able to apply the formula step-by-step to small datasets (3-4 points) as shown in the examples.
🧠 Quick Revision Questions
- What is the main advantage of Lagrange’s interpolation over Newton’s forward/backward formulas?
- Write down the general expression for the Lagrange basis polynomial (L_i(x)).
- What is the value of (L_i(x_j)) when (i = j) and when (i \neq j)? What is this property called?
- In the example with points ((1,-3), (3,0), (4,30), (6,132)), what is the value of (y(5))?
- If you have 5 data points, what is the maximum degree of the Lagrange interpolating polynomial that fits them?
📘 Lecture 22 — Divided Differences
📖 Overview: This lecture introduces the concept of divided differences, a fundamental tool for constructing interpolation polynomials when data points are not equally spaced. It defines divided differences recursively, presents the standard symmetric form, and develops Newton's divided difference interpolation formula, showing its equivalence to Lagrange's form while requiring fewer arithmetic operations. The lecture also covers the error term associated with this interpolation method.
🗂️ Topics Covered
The lecture begins by defining zero-th, first, and higher-order divided differences recursively. It then presents the standard symmetric form of divided differences and provides an example of constructing a Newton's divided difference table. Newton's divided difference interpolation formula is derived by choosing coefficients that satisfy the data points, leading to a lower triangular system. The lecture shows that Newton's formula can be expressed in terms of forward, backward, and central differences for equally spaced data. It demonstrates through examples that Newton's and Lagrange's interpolation formulas yield the same polynomial, with Newton's formula being computationally more efficient. Finally, the error term for interpolation is derived using the (n+1)th derivative of the function.
📝 Lecture Summary
DIVIDED DIFFERENCES
Assume the function y = f(x) is known for several values of x, (xᵢ, yᵢ), for i = 0, 1, ..., n. The divided differences of orders 0, 1, 2, ..., n are defined recursively. The zero-th order divided difference is y[x₀] = y(x₀) = y₀. The first order divided difference is defined as y[x₀, x₁] = (y₁ - y₀) / (x₁ - x₀). Similarly, higher order divided differences are defined in terms of lower order divided differences by the relation y[x₀, x₁, ..., xₙ] = (y[x₁, x₂, ..., xₙ] - y[x₀, x₁, ..., xₙ₋₁]) / (xₙ - x₀).
We can easily verify that the divided difference is a symmetric function of its arguments. That is, y[x₀, x₁] = y[x₁, x₀] = y₀/(x₀ - x₁) + y₁/(x₁ - x₀). The general symmetric result is y[x₀, ..., xₖ] = Σᵢ₌₀ᵏ [yᵢ / Πⱼ₌₀,ⱼ≠ᵢᵏ (xᵢ - xⱼ)].
📌 Example: Construct the Newton's divided difference table for values of x = 1, 2, 3, 4, 5, 6 and f(x) = -3, 0, 15, 48, 105, 192.
Solution: The table is:
| x | f(x) | 1st diff | 2nd diff | 3rd diff |
|---|---|---|---|---|
| 1 | -3 | |||
| 2 | 0 | 3 | ||
| 3 | 15 | 15 | 6 | |
| 4 | 48 | 33 | 9 | 1 |
| 5 | 105 | 57 | 12 | 1 |
| 6 | 192 | 87 | 15 | 1 |
🔑 Definition — First order divided difference: y[x₀, x₁] = (y₁ - y₀) / (x₁ - x₀) 📐 Formula: Divided difference recursion: y[x₀, x₁, ..., xₙ] = (y[x₁, x₂, ..., xₙ] - y[x₀, x₁, ..., xₙ₋₁]) / (xₙ - x₀) → The nth order divided difference is the difference of two (n-1)th order differences divided by the interval between the first and last x-values. 📐 Formula: Symmetric form: y[x₀, ..., xₖ] = Σᵢ₌₀ᵏ [yᵢ / Πⱼ₌₀,ⱼ≠ᵢᵏ (xᵢ - xⱼ)] → The divided difference can be expressed as a sum of the function values each divided by the product of differences from all other points.
NEWTON'S DIVIDED DIFFERENCE INTERPOLATION FORMULA
Let y = f(x) be a function which takes values y₀, y₁, ..., yₙ corresponding to x = xᵢ, i = 0, 1, ..., n. We choose an interpolating polynomial in the form y = f(x) = a₀ + a₁(x - x₀) + a₂(x - x₀)(x - x₁) + ... + aₙ(x - x₀)(x - x₁)...(x - xₙ₋₁). The coefficients aₖ are chosen so as to satisfy the (n+1) pairs (xᵢ, yᵢ). This gives a lower triangular system. The first equation gives a₀ = y(x₀) = y₀. The second gives a₁ = (y₁ - y₀) / (x₁ - x₀) = y[x₀, x₁]. The third yields a₂ = y[x₀, x₁, x₂]. Thus, Newton's divided difference interpolation formula can be written as y = f(x) = y₀ + (x - x₀) y[x₀, x₁] + (x - x₀)(x - x₁) y[x₀, x₁, x₂] + ... + (x - x₀)(x - x₁)...(x - xₙ₋₁) y[x₀, x₁, ..., xₙ].
Newton's divided differences can also be expressed in terms of forward, backward and central differences. Assuming equally spaced values of abscissa with spacing h, we have y[x₀, x₁] = Δy₀/h, y[x₀, x₁, x₂] = Δ²y₀/(2!h²), and in general y[x₀, x₁, ..., xₙ] = Δⁿy₀/(n!hⁿ). Similarly, in terms of backward differences, y[x₀, x₁] = ∇y₁/h, y[x₀, x₁, x₂] = ∇²y₂/(2!h²), and in general y[x₀, x₁, ..., xₙ] = ∇ⁿyₙ/(n!hⁿ). In terms of central differences, y[x₀, x₁] = δy₁/₂/h, y[x₀, x₁, x₂] = δ²y₁/(2!h²), and for even and odd orders: y[x₀, x₁, ..., x₂ₘ] = δ²ᵐyₘ/((2m)!h²ᵐ) and y[x₀, x₁, ..., x₂ₘ₊₁] = δ²ᵐ⁺¹yₘ₊₁/₂/((2m+1)!h²ᵐ⁺¹).
📌 Example: Find the interpolating polynomial by (i) Lagrange's formula and (ii) Newton's divided difference formula for the data: x = 0, 1, 2, 4 and y = 1, 1, 2, 5. Hence show they represent the same polynomial.
Solution: The divided difference table is:
| x | y | 1st D.D. | 2nd D.D. | 3rd D.D. |
|---|---|---|---|---|
| 0 | 1 | |||
| 1 | 1 | 0 | ||
| 2 | 2 | 1 | 1/2 | |
| 4 | 5 | 3/2 | 1/6 | -1/12 |
(i) Lagrange's formula gives: f(x) = x³/12 - 3x²/4 + 2x/3 + 1 (ii) Newton's formula gives: f(x) = 1 + (x-0)(0) + (x-0)(x-1)(1/2) + (x-0)(x-1)(x-2)(-1/12) = x³/12 - 3x²/4 + 2x/3 + 1 We observe that the interpolating polynomial by both formulae is one and the same.
💡 Why this matters: Newton's formula involves fewer arithmetic operations than Lagrange's.
📌 Example: Using Newton's divided difference formula, find the quadratic equation for the data: x = 0, 1, 4 and y = 2, 1, 4. Hence find y(2).
Solution: The table is:
| x | y | 1st D.D. | 2nd D.D. |
|---|---|---|---|
| 0 | 2 | ||
| 1 | 1 | -1 | |
| 4 | 4 | 1 | 1/2 |
Newton's formula gives: y = 2 + (x-0)(-1) + (x-0)(x-1)(1/2) = (x² - 3x + 4)/2. Hence y(2) = 1.
📌 Example: Find the equation of a cubic curve through points (4, -43), (7, 83), (9, 327), (12, 1053) using Newton's divided difference formula.
Solution: The table is:
| x | y | 1st D.D. | 2nd D.D. | 3rd D.D. |
|---|---|---|---|---|
| 4 | -43 | |||
| 7 | 83 | 42 | ||
| 9 | 327 | 122 | 16 | |
| 12 | 1053 | 242 | 24 | 1 |
Newton's formula: f(x) = -43 + (x-4)(42) + (x-4)(x-7)(16) + (x-4)(x-7)(x-9)(1) = x³ - 4x² - 7x - 15.
📌 Example: Show that Newton's divided difference and Lagrange's interpolation formulas for three points are identical.
Solution: The Newton formula is y = y₀ + (x-x₀)y[x₀,x₁] + (x-x₀)(x-x₁)y[x₀,x₁,x₂]. Substituting the definitions of divided differences and simplifying yields y = [(x-x₁)(x-x₂)/((x₀-x₁)(x₀-x₂))]y₀ + [(x-x₀)(x-x₂)/((x₁-x₀)(x₁-x₂))]y₁ + [(x-x₀)(x-x₁)/((x₂-x₀)(x₂-x₁))]y₂, which is Lagrange's form.
NEWTON'S DIVIDED DIFFERENCE FORMULA WITH ERROR TERM
Following the basic definition of divided differences, we have the recursive expressions: y(x) = y₀ + (x-x₀)y[x,x₀]; y[x,x₀] = y[x₀,x₁] + (x-x₁)y[x,x₀,x₁]; ... y[x,x₀,...,xₙ₋₁] = y[x₀,x₁,...,xₙ] + (x-xₙ)y[x,x₀,...,xₙ]. Multiplying the second equation by (x-x₀), the third by (x-x₀)(x-x₁), etc., and adding, we obtain y(x) = y₀ + (x-x₀)y[x₀,x₁] + (x-x₀)(x-x₁)y[x₀,x₁,x₂] + ... + (x-x₀)(x-x₁)...(x-xₙ₋₁)y[x₀,x₁,...,xₙ] + ε(x), where ε(x) = (x-x₀)(x-x₁)...(x-xₙ)y[x,x₀,...,xₙ]. The error term vanishes for x = x₀, x₁, ..., xₙ.
ERROR TERM IN INTERPOLATION FORMULAE
If y(x) is approximated by a polynomial Pₙ(x) of degree n, the error is given by ε(x) = y(x) - Pₙ(x) = (x-x₀)(x-x₁)...(x-xₙ)y[x,x₀,...,xₙ]. Alternatively, it can be expressed as ε(x) = ∏(x) y[x,x₀,...,xₙ] = K∏(x). By considering a function F(x) = y(x) - Pₙ(x) - K∏(x) that vanishes at x₀, x₁, ..., xₙ and an arbitrary point x, and applying Rolle's theorem repeatedly, it can be shown that y⁽ⁿ⁺¹⁾(ξ) appears. Since Pₙ(x) is of degree n, its (n+1)th derivative is zero, and ∏⁽ⁿ⁺¹⁾(x) = (n+1)!. Therefore K = y⁽ⁿ⁺¹⁾(ξ) / (n+1)! for some ξ in the interval.
🔑 Definition — Error term: ε(x) = ∏(x) y⁽ⁿ⁺¹⁾(ξ) / (n+1)! 📐 Formula: ε(x) = (x-x₀)(x-x₁)...(x-xₙ) y⁽ⁿ⁺¹⁾(ξ) / (n+1)! → The error in replacing y(x) by an nth degree interpolation polynomial is the product of the differences between x and each data point, multiplied by the (n+1)th derivative of y evaluated at some point ξ, divided by (n+1)!.
⭐ Key Takeaways
Divided differences provide a systematic way to construct interpolation polynomials for unequally spaced data, with the nth order divided difference defined recursively as the difference of two (n-1)th order differences divided by the interval between the extreme x-values. Newton's divided difference interpolation formula uses these differences as coefficients in a polynomial expressed as progressively nested factors (x-xᵢ), making it computationally more efficient than Lagrange's formula since adding a new data point only requires computing one additional term. The divided difference is a symmetric function of its arguments, and for equally spaced data it reduces to forward, backward, or central differences scaled by factorial and step size terms. The error in interpolation is proportional to the product of distances from interpolation points and the (n+1)th derivative, highlighting that higher-degree polynomials can be more accurate for smooth functions but potentially worse near boundaries.
🧠 Quick Revision Questions
- Define the first-order divided difference y[x₀, x₁] and write its formula in terms of y₀ and y₁.
- Write Newton's divided difference interpolation formula for n data points (x₀, y₀), (x₁, y₁), ..., (xₙ, yₙ).
- For equally spaced data with step size h, what is y[x₀, x₁, x₂] in terms of forward differences?
- State the formula for the error term ε(x) when a function y(x) is approximated by an nth degree interpolation polynomial.
- Show that for three points (x₀, y₀), (x₁, y₁), (x₂, y₂), Newton's and Lagrange's interpolation formulas are equivalent.