Skip to main content

Numerical Methods · Interpolation and approximation

Matching values and derivatives needs repeated-node divided differences

Problem

Numerical Methods practice problem

Let f(x)=x4f(x)=x^4. Osculatory (Hermite) interpolation at the nodes 00 and 11 seeks the unique polynomial HH of degree at most 33 satisfyingH(0)=f(0),H′(0)=f′(0),H(1)=f(1),H′(1)=f′(1).H(0)=f(0),\quad H'(0)=f'(0),\quad H(1)=f(1),\quad H'(1)=f'(1).1. Form the Newton divided-difference table for the repeated abscissae z=(0,0,1,1)z=(0,0,1,1), using the rule that a first divided difference on a repeated node equals the derivative. Compute every entry, and write the Newton–Hermite formH(x)=f[z0]+f[z0,z1](x−z0)+f[z0,z1,z2](x−z0)(x−z1)+f[z0,z1,z2,z3](x−z0)(x−z1)(x−z2).H(x)=f[z_0]+f[z_0,z_1](x-z_0)+f[z_0,z_1,z_2](x-z_0)(x-z_1)+f[z_0,z_1,z_2,z_3](x-z_0)(x-z_1)(x-z_2).Simplify HH to the monomial basis.

2. Independently assemble HH in the two-node Hermite basisα0(x)=(1+2x)(1−x)2,β0(x)=x(1−x)2,α1(x)=(3−2x)x2,β1(x)=(x−1)x2,\begin{aligned} \alpha_0(x)&=(1+2x)(1-x)^2,& \beta_0(x)&=x(1-x)^2,\\ \alpha_1(x)&=(3-2x)x^2,& \beta_1(x)&=(x-1)x^2, \end{aligned}and verify that the two constructions agree. Check the four interpolation conditions directly on your simplified HH.

3. State the Hermite remainder theorem for this data: there is ξx\xi_x strictly between the extreme nodes and xx (when x∉{0,1}x\notin\{0,1\}) such thatf(x)−H(x)=f(4)(ξx)4! x2(x−1)2.f(x)-H(x)=\frac{f^{(4)}(\xi_x)}{4!}\,x^2(x-1)^2.Evaluate both sides exactly at x=1/2x=1/2, and conclude that the remainder identity is an equality of polynomials in this example.

4. Explain why a degree-at-most-11 Lagrange interpolant of the values f(0),f(1)f(0),f(1) alone cannot meet the derivative conditions, and why the nodal factor here is x2(x−1)2x^2(x-1)^2 rather than the degree-44 equispaced nodal product of a Runge/Chebyshev value-interpolation comparison.

Do not replace the osculatory table by value interpolation on four distinct nodes, and do not treat this as an equispaced-versus-Chebyshev remainder audit.

Hint

Hint

The first-layer entries of the table are f′(0)=0f'(0)=0, (f(1)−f(0))/(1−0)=1(f(1)-f(0))/(1-0)=1, and f′(1)=4f'(1)=4.

Check your work

Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.

The answer check and full solution for this problem come with ProofAnvil Practice membership ($19 USD monthly). See membership. Or start with the free Numerical Methods sample problem: Try the free sample problem.

More Numerical Methods practice problems

Back to Numerical Methods

An original ProofAnvil practice problem, written for this course. ProofAnvil is a practice course, not a homework-answer service.