If the guesses don't converge within some number of steps, such as <math> n = 16 </math> reduce h and repeat the step. ToIf optimizeI thisremember correctly, ifthe iterative process converges quadratically. If the stepsguesses converge toovery soonquickly, suchyou asmight 4consider stepsincreasing h, thenbut increasenote h.that Ifthe Iover rememberall correctly,error is unrelated to convergence in the iterativealgorithm processbut convergesinstead quadraticallyto the step size and the core method, which in this example is a trapezoidal, (linear) approximation of the actual function. Also see [[stiff equation]]
Note that convergence in the algorithm doesn't imply that there's no error. In this case a linear approximation (trapezoid rule) is being used for each step. See [[stiff equation]]
[[User:Jeffareid|Jeffareid]] ([[User talk:Jeffareid|talk]]) 04:42, 21 July 2009 (UTC)
