Dear all,
I am trying to implement a recursive algorithm that is rather complex,
in the sense that it uses a high number of variables and (elementary)
computations. The output in Sage looks fine but it gets quite slow, so
I am thinking of ways to speed it up. Given that it is mainly a lot of
loopi
Hi,
Jason Grout wrote:
> sage: pari(RealField(500)(10)).eint1().python()
> 4.15696892968532427740285981027818038434629008241953313262759569712786222819608803586147163177527802101305497591041862309918139192016097135380721447598904e-6
> sage: RealField(500)(10).eint()
> 2492.228976241877759
Hi,
as a followup on the "Arbitrary precision in cython" thread, I'd like to
mention that one can directly use mpfr's implementation from within Sage:
sage: RealField(150)(10).eint()
2492.2289762418777591384401439985248489896471
It only works for real numbers, but has the advantage to gu
I have recently been experimenting with converting some simple python
functions that I have made into cython. I have been quite impressed by
how simple it is for the massive speed increases that I have seen.
However, one thing that is mildly annoying at times is the limitation
to double precision
