Numerical Methods · Numerical ODE and introductory PDE methods
Linear shooting hits the far boundary in one sensitivity step
Problem
Numerical Methods practice problemConsider the linear two-point problem1. Solve the initial-value problem with and in closed form. Deduce the unique missing slope for which , and write the exact solution . Equivalently, introduce the pair of IVPsand obtain from .
2. Let . Derive the sensitivity IVP satisfied by , evaluate , and perform one Newton updatefrom the initial guess . Prove that and explain why a linear BVP needs only one such correction.
3. Now discretize the first-order system , by Heun's method (improved Euler) with , starting from , . Compute the discrete map with exact rational arithmetic, and solve . Confirm that one discrete Newton step from , using the discrete sensitivity , recovers the same slope.
4. Do not replace shooting by a centered three-point Poisson stencil, do not treat the far condition as , and do not iterate Newton as if were a genuinely nonlinear scalar map.
Hint
HintA particular solution of is . The homogeneous solutions are and , and kills the coefficient.
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
- Two Gauss nodes integrate cubics exactly and miss a concrete quarticNumerical differentiation and quadrature