#2567: remove limitation on computing digits of pi using mpfr
------------------------------+---------------------------------------------
Reporter: was | Owner: somebody
Type: defect | Status: new
Priority: major | Milestone: sage-3.4.1
Component: basic arithmetic | Resolution:
Keywords: |
------------------------------+---------------------------------------------
Comment (by zimmerma):
> You could use the pi function in mpmath; as far as I know, it is limited
only by available memory. I just verified that computing 100 million
digits works on a 32-bit system. The last time someone compared, it was
also about three times faster than MPFR (but probably less memory
efficient).
I am curious. Can you give real timings? Here is what I get on sage.math:
{{{
zimme...@sage:~/mpfr-2.4.0/tests$ pwd
/home/zimmerma/mpfr-2.4.0/tests
zimme...@sage:~/mpfr-2.4.0/tests$ time ./tconst_pi 332192809 0 0
real 42m21.420s
user 41m55.500s
sys 0m25.910s
}}}
This is without using the new FFT code we designed with Gaudry and Kruppa,
which should give a
twofold speedup. Anyway if mpmath can compute 100 million digits in less
than 15 minutes, I am
really impressed!
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/2567#comment:5>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
