26 Jan
2008
26 Jan
'08
8:59 a.m.
* Richard B. Kreckel <kreckel@ginac.de> [Jan 26. 2008 17:04]:
[...] With the truncation technique I described earlier, the memory needed is basically independent of the series. The growth of numerator and denominator is limited to the precision of the result. The computation of Euler's γ in CLN-1.2.0 is actually an excellent example for this. See the two graphs at [0] and observe that the blue curves' maximum is not so different after all (it peaks at 8.4MiB for π and for 15.6MiB for γ.) What you write is correct without truncation, though. See the red and green curves.
Oha! I'll update (brain & text), thanks for the input!
Cheers -richy.
[0] <http://www.ginac.de/~kreckel/news.html#EulerConstantOneBillionDigits>
cheers, jj