Hi all, I started this project: http://code.google.com/p/fastfunlib/
I'm going to implement algorithms that I originally prototyped in Python or Cython for mpmath earlier this year; I'm doing it in plain C since the code mostly involves plain GMP/MPIR calls and additional dependencies aren't really necessary. A preliminary result (output shown on the project page) is that exp(x) can be computed at least three times faster than MPFR 2.4.1 on my 64-bit AMD system, for all precisions up to at least 1000 decimal digits. Further optimizations to this code should be possible, and results should be similar for the other elementary functions. Based on my Cython code, I expect being 20-30x faster than MPFR for the gamma function when I get there. Once this becomes a working library, I may use it in mpmath... I think there are also some uses for which Sage code could wrap it directly. (And if the MPFR developers like the code, they are of course welcome to use it for their library too.) Fredrik --~--~---------~--~----~------------~-------~--~----~ To post to this group, send an email to [email protected] To unsubscribe from this group, send an email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
