← 2021 Paper 2

UPSC 2021 Maths Optional Paper 2 Q8b — Step-by-Step Solution

15 marks · Section B

Newton's Backward Difference Interpolation · Numerical Analysis · Read the full method →

Question

Derive Newton’s backward difference interpolation formula; do error analysis.

Technique

Operator algebra ∇=1−E−1\nabla=1-E^{-1}; binomial expansion of Ep=(1−∇)−pE^p=(1-\nabla)^{-p}; standard error formula for polynomial interpolation.

Solution

Setup. Given data points (x0,y0),(x1,y1),…,(xn,yn)(x_0,y_0),(x_1,y_1),\ldots,(x_n,y_n) with xi=x0+ihx_i=x_0+ih (equally spaced).

Backward difference operator: ∇yi=yi−yi−1\nabla y_i=y_i-y_{i-1}.

Higher orders: ∇2yi=∇yi−∇yi−1=yi−2yi−1+yi−2\nabla^2 y_i=\nabla y_i-\nabla y_{i-1}=y_i-2y_{i-1}+y_{i-2}, etc.

Step 1 — Newton’s backward difference formula

For interpolation near xnx_n (the last point), write x=xn+phx=x_n+ph, so p=(x−xn)/hp=(x-x_n)/h (note p≤0p\le 0 for x≤xnx\le x_n).

Newton’s backward difference formula:

y(x)=yn+p∇yn+p(p+1)2!∇2yn+p(p+1)(p+2)3!∇3yn+⋯+p(p+1)⋯(p+n−1)n!∇nyn.y(x)=y_n+p\nabla y_n+\dfrac{p(p+1)}{2!}\nabla^2 y_n+\dfrac{p(p+1)(p+2)}{3!}\nabla^3 y_n+\cdots+\dfrac{p(p+1)\cdots(p+n-1)}{n!}\nabla^n y_n.

Step 2 — Derivation

Using the relationship between EE (shift operator: Eyi=yi+1Ey_i=y_{i+1}) and ∇\nabla: ∇=1−E−1\nabla=1-E^{-1}, so E−1=1−∇E^{-1}=1-\nabla, E=1/(1−∇)E=1/(1-\nabla).

For interpolation at x=xn+phx=x_n+ph: y(xn+ph)=Epyn=(1−∇)−pyny(x_n+ph)=E^p y_n=(1-\nabla)^{-p}y_n.

Expand binomially: (1−∇)−p=∑k=0∞(−pk)(−∇)k=∑k=0∞(p+k−1k)∇k(1-\nabla)^{-p}=\sum_{k=0}^\infty\binom{-p}{k}(-\nabla)^k=\sum_{k=0}^\infty\binom{p+k-1}{k}\nabla^k.

(Using (−pk)=(−1)k(p+k−1k)\binom{-p}{k}=(-1)^k\binom{p+k-1}{k}.)

So y(xn+ph)=∑k=0np(p+1)⋯(p+k−1)k!∇kyny(x_n+ph)=\sum_{k=0}^n\dfrac{p(p+1)\cdots(p+k-1)}{k!}\nabla^k y_n,

which is the Newton’s backward formula stated above.

Step 3 — Error analysis

For a function y(x)y(x) that is (n+1)(n+1)-times differentiable on the interval containing the data points, the error in Newton’s backward formula is:

E(x)=p(p+1)⋯(p+n)(n+1)!⋅hn+1⋅y(n+1)(ξ)E(x)=\dfrac{p(p+1)\cdots(p+n)}{(n+1)!}\cdot h^{n+1}\cdot y^{(n+1)}(\xi)

for some ξ\xi in the interval [x0,xn][x_0,x_n].

Derivation: Standard result from polynomial interpolation theory. The error in any interpolation polynomial of degree ≤n\le n through n+1n+1 points is

E(x)=(x−x0)(x−x1)⋯(x−xn)(n+1)!y(n+1)(ξ)E(x)=\dfrac{(x-x_0)(x-x_1)\cdots(x-x_n)}{(n+1)!}y^{(n+1)}(\xi).

In terms of pp (with x=xn+phx=x_n+ph): (x−xi)=(xn+ph−xi)=h(p+(n−i))(x-x_i)=(x_n+ph-x_i)=h(p+(n-i)).

So (x−x0)(x−x1)⋯(x−xn)=hn+1p(p+1)(p+2)⋯(p+n)(x-x_0)(x-x_1)\cdots(x-x_n)=h^{n+1}p(p+1)(p+2)\cdots(p+n).

Hence error formula as above.

Step 4 — Summary

Answer

  y(x)=yn+p∇yn+p(p+1)2!∇2yn+⋯+p(p+1)⋯(p+n−1)n!∇nyn;E(x)=p(p+1)⋯(p+n)(n+1)!hn+1y(n+1)(ξ).  \boxed{\;y(x)=y_n+p\nabla y_n+\dfrac{p(p+1)}{2!}\nabla^2 y_n+\cdots+\dfrac{p(p+1)\cdots(p+n-1)}{n!}\nabla^n y_n;\quad E(x)=\dfrac{p(p+1)\cdots(p+n)}{(n+1)!}h^{n+1}y^{(n+1)}(\xi).\;}
We post more of this — worked solutions, CSAT trap breakdowns, guide chapters — a few times a week on Telegram. Free, no sign-in. Join

This solution is part of the Maths Coverage Map — 14 years, mapped. Get the take-away PDF free.