Timeline for What is the fastest way to compute digits of $\pi$ using Mathematica?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 25, 2016 at 16:52 | history | edited | george2079 | CC BY-SA 3.0 |
added 717 characters in body
|
| Feb 25, 2016 at 14:32 | comment | added | george2079 | A check would be needed if you want to specify the desired precision. I don't think you'll make it faster if the desired precision is 7105 digits though :) | |
| Feb 25, 2016 at 5:02 | comment | added | J. M.'s missing motivation♦ |
It would be faster to check the a[k] if they are getting sufficiently small instead of hardcoding an upper limit like 500 so that there are no needless evaluations.
|
|
| Feb 24, 2016 at 22:58 | comment | added | george2079 | compile i think only works at machine precision, so you can't simply compile this implementation. | |
| Feb 24, 2016 at 20:18 | comment | added | Dargor | Maybe it can be compiled for better performance. | |
| Feb 24, 2016 at 20:07 | history | edited | george2079 | CC BY-SA 3.0 |
added 1 character in body
|
| Feb 24, 2016 at 19:40 | history | edited | george2079 | CC BY-SA 3.0 |
added 131 characters in body
|
| Feb 24, 2016 at 19:24 | history | answered | george2079 | CC BY-SA 3.0 |