Numerical Methods · Numerical differentiation and quadrature
Two Gauss nodes integrate cubics exactly and miss a concrete quartic
Problem
Numerical Methods practice problemWork throughout with the standard inner product. Let , , and denote the first three Legendre polynomials, which are orthogonal on .
1. Show that the roots of are . Determine the unique weights that make the interpolatory ruleexact for and . Equivalently, evaluate the classical weight formulaRecord explicitly.
2. Prove that is exact for every polynomial of degree at most . You may use either the interpolatory error formula or orthogonality of to . Give a one-line counterexample showing that exactness can fail at degree .
3. Let . Compute and as rational numbers, and record the signed error . Deduce the constant in the representation for every quartic . Then, using the three-point Gauss–Legendre nodes and weights , verify that the three-point rule is exact on .
4. Transfer to by the affine map . Write the resulting nodes and weights, evaluate the mapped rule on and on , and compare with the exact integrals and . Explain why the cubic is recovered exactly while the quartic error equals the reference error from part 3.
Do not replace Gauss nodes by Chebyshev extrema or by equispaced Newton–Cotes nodes, and do not invoke an adaptive panel-halving estimator.
Hint
HintThe even/odd split of the moment system forces as soon as the nodes are symmetric, and the constant-function moment then gives each weight equal to .
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 ∈ ℝ^(n×n) be strictly row-diagonally dominant, and let G_J=D⁻¹(L+U) be the Jacobi…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
- Matching values and derivatives needs repeated-node divided differencesInterpolation and approximation
- Linear shooting hits the far boundary in one sensitivity stepNumerical ODE and introductory PDE methods