I am working on a program written in Rust to calculate pi to an arbitrary number of digits, preferably using the Chudnovsky algorithm.
I am working on a program written in Rust to calculate pi to an arbitrary number of digits, preferably using the Chudnovsky algorithm.
I finally got an optimized Chudnovsky algorithm working. For 1000 digits, it seems to save about 6 seconds, not terrible.
Log in to leave a comment
I added user input for the number of digits! It seems that computation time grows exponentially with the number of digits right now, so I need to do research into how to optimize the algorithm for faster computation.
Log in to leave a comment
I finally got the program fully working with 1000 digits of precision. All that is left to do now is take user input for the number of digits and optimize the algorithm itself.
Log in to leave a comment
So far I have a first working-ish version of the program, it is supposed to be accurate to 1000 digits right now and is only accurate to about 120 so I imagine there is a rounding error somewhere, but it is a first version. Also needs insane optimization because right now it is really really slow.
Log in to leave a comment