Next: Towards a fourth attempt
Up: Exact numerical computation
Previous: Towards a third attempt
In this attempt we proceed as in the second, but using lazy
evaluation. But, as it turns out, if there is an improvement, it is
imperceptible. The reason is more or less obvious. In the usual
algorithms, which are the ones that we implemented, least significant
digits are computed first. Thus, even if one wants only one
significative digit of fn(x0), more than 2n digits have to be
computed first.
Martin Escardo
2000-10-02