1. Lagrange Form

Definition – Lagrange interpolating polynomial

Definition – Lagrange basis polynomials

Written out:

is a weighting function: a product of factors, with the factor left out.

Property (extra)

for every (interpolating the constant must return ). This is a quick check on your arithmetic.

⚠️ Numerator: with the variable . Denominator: with the node . Both skip . Mixing them up is the most common mistake.


2. Linear Lagrange Interpolation

Formula

Two points :

This is the same line as in 3.1.

Example (slides) – rocket, , , find

(s)010152022.530
(m/s)0227.04362.78517.35602.97901.67

⚠️ The slide writes ; the table value is 362.78 (and only comes out with 362.78).


3. Quadratic Lagrange Interpolation

Example (slides) – nodes , ,

At :

BasisComputationValue
check ✓

Quadratic Lagrange bases on nodes 10, 15, 20101214161820-0.400.40.81.2at t=16: L0=−0.08, L1=0.96, L2=0.12tLᵢ(t)L0(t)L1(t)L2(t)


4. Cubic Lagrange Interpolation

Example (slides) – nodes 10, 15, 20, 22.5

At (weights worked out here, extra):

Sum
✓
MethodLinearQuadraticCubic
Direct (3.1)393.70392.19392.06
Newton (3.2)393.70392.19392.06
Lagrange (3.3)393.70392.19392.06

⚠️ All three methods produce the same polynomial (uniqueness theorem), just written differently. Pick whichever form is cheapest for the task.


5. When to Use Lagrange vs Newton

SituationUseReason
Same nodes , changed LagrangeThe depend only on the , so keep them and just change the weights . Newton would need the whole divided-difference table again
Adding a data pointNewtonAdd one row and one column to the table. Lagrange needs every recomputed (each gains a new factor)