Interactive · 2 questions

Newton interpolation, or the method of finite differences, is a very interesting technique used in polynomial problems:

Example. Let f(x)f(x) be a cubic polynomial such that f(0)=5,f(0) = 5, f(1)=4,f(1) = 4, f(2)=17,f(2) = 17, and f(3)=56.f(3) = 56. Compute f(4).f(4).

How would you first try to solve this problem (if you know about finite differences, how would you do it without them?)

A possible method would be the following:

"Well, we can say f(x)=ax3+bx2+cx+d,f(x) = ax^3+bx^2+cx+d, where a,b,c,a, b, c, and dd are some real numbers. Then, we have four equations: f(0)=d  =5,f(1)=a+b+c+d  =4,f(2)=8a+4b+2c+d  =17,f(3)=27a+9b+3c+d  =56.\begin{aligned} f(0) = d \;&= 5, \\f(1) = a+b+c+d \; &= 4, \\ f(2) = 8a+4b+2c+d \;&= 17, \\ f(3) = 27a+9b+3c+d \; &= 56. \end{aligned} We can solve this system (four equations, four variables) for a,b,c,a, b, c, and d,d, and so we can determine what f(x)f(x) is. Then, we can plug in x=4x = 4 to get our answer!"

While this, in theory, is a good idea, it's not always very practical. Solving that system would be rather tedious without a computer or calculator, and it's very computationally error-prone (unless you're Art Benjamin). Finite differences gives us a better, and much more elegant, way to solve this problem.

Consider some arbitrary cubic polynomial, P(x)=ax3+bx2+cx+d.P(x) = ax^3 + bx^2 + cx + d. We define the first finite difference of P(x)P(x) as

Δ1(x):=P(x+1)−P(x).\Delta_1(x) := P(x+1) - P(x).

Try computing Δ1(x)\Delta_1(x) in terms of a,b,c,a, b, c, and d,d, before moving on.

For P(x),P(x), we get

Δ1(x)=a(x+1)3+b(x+1)2+c(x+1)+d−ax3−bx2−cx−d,\Delta_1(x) = a(x+1)^3 + b(x+1)^2 + c(x+1) + d \\ - ax^3 - bx^2 - cx - d,

which simplifies to Δ1(x)=3ax2+(3a2+2b)x+(a+b+c).\Delta_1(x) = 3ax^2 + (3a^2+2b)x + (a+b+c).

Anything you notice about this new polynomial, compared to the old one, P(x)?P(x)?

The important thing for us is not the exact coefficients of Δ1,\Delta_1, but the fact that Δ1\Delta_1 is now a quadratic, not a cubic: the x3x^3 terms canceled when we subtracted P(x)P(x) from P(x+1).P(x+1).

If we try the finite-difference operation again, we'll see that we cancel out the x2x^2 terms as well. This gives us the second finite difference:

Δ2(x):=Δ1(x+1)−Δ1(x),\Delta_2(x) := \Delta_1(x+1) - \Delta_1(x),

which simplifies to Δ2(x)=6ax+(3a+3a2+2b).\Delta_2(x) = 6ax + (3a+3a^2+2b). Now we have a linear polynomial! If we repeat the operation once more, we get that the third finite difference is Δ3(x)=6a,\Delta_3(x) = 6a, a constant polynomial ("degree 00").

Well, how does this help us in the original problem?

Choose one answer

Interactive · 1 question

This exercise is meant to show one of the surprising and beautiful connections between finite differences/partial sums and "actual" calculus.

Problem. Let f(x)=xn,f(x) = x^n, for some positive integer n.n. Show that Δ1(x)=nxn−1+…\Delta_1(x) = nx^{n-1} + \ldots (where the ellipsis represents a bunch of terms of degree at most n−2n-2). That is, show that Δ1(x)\Delta_1(x) is an (n−1)(n-1)th degree polynomial, with leading coefficient n.n.

Select "Continue!" when you think you have it, or click "Hint please!" for a hint.

Choose one answer

Type a concept, like “slope” or “photosynthesis”.

↑ ↓ to choose · Enter to openSearch explanations and problems