Content deleted Content added
Line 28:
: <math>y_{i+1} = \tilde{y}_{g+n}.</math>
If the guesses don't converge within some number of steps, such as <math> n = 16 </math> reduce ''h'' and repeat the step or repeat the integration since ''h'' was too large. If I remember correctly, the iterative process converges quadratically. As an alternative to an error tolerance, the iteration count can be just some fixed number ''n''. If the guesses converge very quickly, you might consider increasing ''h'', but note that the overall error is unrelated to convergence in the algorithm but instead to the step size and the core method, which in this example is a trapezoidal, (linear) approximation of the actual function. The step size ''h'' ( <math>\Delta{t} </math> ) needs to be relatively small in order to get a good approximation. Also see [[stiff equation]]
[[User:Jeffareid|Jeffareid]] ([[User talk:Jeffareid|talk]]) 05:35, 21 July 2009 (UTC)
| |||