Re: [Maxima-discuss] e, pi, gamma, log(2), also mpfr, also sympy

[Volker v. N. <vol...@gm...>]

Am 21.09.2014 18:10, schrieb Richard Fateman:
> 
> I do not know if the splitting formula is the very fastest... I found
> this reference
> http://www.craig-wood.com/nick/articles/pi-chudnovsky/
> 
> which is not the most erudite discussion, but he claims his new code is
> faster than "BPP".
> However most of the time is spent in computing the sqrt of an integer.
> 

Short remark:

That was the page where I found the link to the paper of Haible and
Papanikolaou.

Yes, the sqrt part of the Chudnovsky formula is very time comsuming. For
this problem I found an optimization.
(I spent a lot of time with this problem and experimented with some
alternatives. A binary splitted Taylor-series for the sqrt showed very
good results but I ended I with an optimized Heron.)