Numerical Methods · Root finding and nonlinear systems
A fixed-point rearrangement is useless unless it contracts on an invariant interval
Problem
Numerical Methods practice problemLet and let . A root of in is a fixed point of any satisfying at that point. Consider the three candidate rearrangementseach of which is algebraically equivalent to wherever it is defined and the original equation holds.
1. State the contraction-mapping theorem on a closed real interval: if satisfies for some and all , then has a unique fixed point , the Picard iterates converge to from every , andProve uniqueness and the displayed a priori bound from the geometric estimate . If is differentiable, record the mean-value test on .
2. For each of , , and , decide whether and whether (where the derivative exists). Select the unique candidate that is a contraction self-map of , and exhibit an explicit Lipschitz constant .
3. Starting from , compute the Picard iterates of the successful map as exact rationals. Identify the sequence with consecutive Fibonacci ratios and evaluate the exact limit .
4. Apply the a priori bound of part 1 at with your . Compare it with the true error . Explain why an algebraically correct rearrangement can still be an illegal iteration on , using as the witness. Do not replace the argument by a Newton basin analysis.
Do not declare a map usable on merely because it shares the correct fixed-point equation.
Hint
HintUniqueness is immediate from . The a priori bound is the tail of a geometric series of increments.
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
- 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
- Linear shooting hits the far boundary in one sensitivity stepNumerical ODE and introductory PDE methods