Numerical Methods · Interpolation and approximation
Matching values and derivatives needs repeated-node divided differences
Problem
Let $f(x)=x^4$. Osculatory (Hermite) interpolation at the nodes $0$ and $1$ seeks the unique polynomial $H$ of degree at most $3$ satisfying \[ 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)$, using the rule that a first divided difference on a repeated node equals the derivative. Compute every entry, and write the Newton–Hermite form \[ 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 $H$ to the monomial basis. 2. Independently assemble $H$ in the two-node Hermite basis \[ \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 $H$. 3. State the Hermite remainder theorem for this data: there is $\xi_x$ strictly between the extreme nodes and $x$ (when $x\notin\{0,1\}$) such that \[ f(x)-H(x)=\frac{f^{(4)}(\xi_x)}{4!}\,x^2(x-1)^2. \] Evaluate both sides exactly at $x=1/2$, and conclude that the remainder identity is an equality of polynomials in this example. 4. Explain why a degree-at-most-$1$ Lagrange interpolant of the values $f(0),f(1)$ alone cannot meet the derivative conditions, and why the nodal factor here is $x^2(x-1)^2$ rather than the degree-$4$ 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
The first-layer entries of the table are $f'(0)=0$, $(f(1)-f(0))/(1-0)=1$, and $f'(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
- A decimal floating-point system uses base β = 10, precision t = 4, and exponent range…Floating-point arithmetic, conditioning, and stability
- In four-digit decimal floating-point arithmetic with rounding to nearest, compute…Floating-point arithmetic, conditioning, and stability
- Let g be continuously differentiable on an open interval containing a fixed point…Root finding and nonlinear systems
- Let A∈R^(n× n) be strictly row-diagonally dominant, and let G_J=D^(-1)(L+U) be the…Linear systems, least squares, and eigenproblems
- The values f(1.0)=2.7183, f(1.1)=3.0042, f(1.2)=3.3201, and f(1.3)=3.6693 are given…Interpolation and approximation
- A fixed-point rearrangement is useless unless it contracts on an invariant intervalRoot finding and nonlinear systems
- Two conjugate-gradient steps close an SPD two-by-two residualLinear systems, least squares, and eigenproblems
- Two Gauss nodes integrate cubics exactly and miss a concrete quarticNumerical differentiation and quadrature
- Linear shooting hits the far boundary in one sensitivity stepNumerical ODE and introductory PDE methods