On Convergence Rates of Root-Seeking Methods

[emece67]

(03-18-2018 06:34 PM)rprosperi Wrote:  

(03-18-2018 03:06 PM)emece67 Wrote:  I finally computed square roots in Python upto 1 billion digits, comparing 8 methods....

Where/how do you store such a result? Or rather 8 of them?

Are these > 1GB text files?

And assuming so, how do you actually manipulate (e.g. even to simply compare) such large files?

Whatever the answers, kudos for your perseverance and patience.

Oops, it was my fault. There were no billion digits, but 1 billion bits, this is ~300 million decimal digits. I screwed it up when switching to gmpy.

In any case, the program does not store them on disk. After each run it only reports the number of iterations needed, the time spent and the number of correct digits in the result. When running at the maximum precision of ~300 million digits it takes ~2.5 GB of RAM.

Not big merit on my part, the program is straightforward, the Python, mpmath, gmpy and GMP developers do have it.

Sorry & regards.