A dynamical strategy for approximation methods

The numerical result provided by an approximation method is affected by a global error, which consists of both a truncation error and a round-off error. Let us consider the converging sequence generated by successively dividing by two the step size used. If computations are performed until, in the convergence zone, the difference between two successive approximations is only due to round-off errors, then the global error on the result obtained is minimal. Furthermore its significant bits which are not affected by round-off errors are in common with the exact result, up to one.