I can provide an implementation of the "droplet" algorithm for computing pi, based on work by Borwein, Rabinowitz, and Wagon. It does neither use 'mpfr' nor big floats, only simple arithmetic. It will spit out about 50,000 digits one after the other -- with more digits it gets too slow. A speed-up of the factor 10 or so will be possible with some tricks. As a test I am abut to reimplement it in Nim. As Nim can also generate C or C++ code, it will be interesting to compare C, Nim, and Julia on this non-trivial, but straightforward algorithm.
- [julia-users] Informal Call for a Julia π - day challeng... Alan Edelman
- [julia-users] Re: Informal Call for a Julia π - day... Ivar Nesje
- [julia-users] Re: Informal Call for a Julia π -... Luis Benet
- Re: [julia-users] Re: Informal Call for a Julia... Alan Edelman
- [julia-users] Re: Informal Call for a Julia π - day... Johan Sigfrids
- [julia-users] Re: Informal Call for a Julia π -... Simon Byrne
- Re: [julia-users] Re: Informal Call for a J... Alan Edelman
- Re: [julia-users] Re: Informal Call for... Simon Byrne
- Re: [julia-users] Re: Informal Call for... Hans W Borchers
- Re: [julia-users] Re: Informal Cal... Alan Edelman
- Re: [julia-users] Re: Informal... Hans W Borchers
- Re: [julia-users] Re: Informal... Hans W Borchers
- Re: [julia-users] Re: Info... David van Leeuwen
- Re: [julia-users] Re: Info... Steven G. Johnson
- Re: [julia-users] Re: Info... Alan Edelman
- Re: [julia-users] Re: Info... Simon Byrne
- Re: [julia-users] Re: Info... Hans W Borchers
- Re: [julia-users] Re: Info... Steven G. Johnson
- Re: [julia-users] Re: Info... Hans W Borchers