- **Programming**
(*https://www.mersenneforum.org/forumdisplay.php?f=29*)

- - **Fast continued fraction cruncher**
(*https://www.mersenneforum.org/showthread.php?t=26674*)

Fast continued fraction cruncherZuuv is a program that can compute the [I]regular continued fraction[/I] of a number from it's floating-point representation (a file containing hex or dec digits). It features log-linear runtime, disk-based computations (for large computations), fault tolerance, and basic multi-threading.
Zuuv can easily be used to break world records for terms of continued fractions of constants like Pi, Euler-Mascheroni etc. even on regular PCs with enough dedication. For example, Zuuv took four hours on my poor Intel i5 9th gen laptop to churn out 2.4 billion terms of Euler-mascheroni constant's continued fraction (the world record is just ~4.8 billion) I just released the first alpha version of Zuuv yesterday, so feedback would be much appreciated. Here's the [URL="https://github.com/sinandredemption/zuuv"]GitHub[/URL] :) |

[QUOTE=sinandredemptio;575231]Zuuv is a program that can compute the [I]regular continued fraction[/I] of a number from it's floating-point representation (a file containing hex or dec digits). It features log-linear runtime, disk-based computations (for large computations), fault tolerance, and basic multi-threading.
Zuuv can easily be used to break world records for terms of continued fractions of constants like Pi, Euler-Mascheroni etc. even on regular PCs with enough dedication. For example, Zuuv took four hours on my poor Intel i5 9th gen laptop to churn out 2.4 billion terms of Euler-mascheroni constant's continued fraction (the world record is just ~4.8 billion) I just released the first alpha version of Zuuv yesterday, so feedback would be much appreciated.[/QUOTE]Released it how and where? Hard to give feedback without access to it. |

[QUOTE=xilman;575245]Released it how and where?
Hard to give feedback without access to it.[/QUOTE] Well, this is embarrassing. Here's the [URL="https://github.com/sinandredemption/zuuv"]GitHub[/URL] :) |

New program to crunch continued fraction expansion of constantsZuuv is an open-source program that can compute the [URL="https://en.wikipedia.org/wiki/Continued_fraction"]regular continued fraction[/URL] of a number from it's floating-point representation (a file containing hex or dec digits). Just like y-cruncher, it's features include:
[LIST][*]Ability to crunch billions of terms in reasonable time[*]Advanced algorithms for log-linear runtime[*]Ability to utilize hard-disk to perform extremely large calculations[*]Ability to automatically save and resume partial computations[*]Multi-threading[/LIST]Zuuv has been utilized to break world records for computation of regular continued fraction terms of important mathematical constants such as Pi, Euler-Mascheroni etc, all done on a regular PC (i5 9300H, 8GB RAM). Link to repository: [URL]https://github.com/sinandredemption/zuuv[/URL] Link to Windows builds (for modern processors): [URL]https://github.com/sinandredemption/zuuv/tree/main/builds/modern[/URL] Please free to ask questions and put out suggestions or constructive criticism. Or contact me personally if you are interested in running a sizeable computation. [B]Disclaimer[/B]: The author of this post is also the author of Zuuv, and Zuuv is not affiliated in any way with y-cruncher or A. Yee himself. PS I am posting this because I thought more of you should know about Zuuv. In case this qualifies as spam, please inform me and I will delete this post. [color=red][b]MODERATOR NOTE: This post started another thread. It was on the same topic as this thread. I merged that thread into this one. Starting new threads on the same topic as threads you previously started ("multiposting"), is considered bad behavior on this Forum. It recently got another user banned.[/b][/color] |

[QUOTE=sinandredemptio;587931]Zuuv is an open-source program that can compute the [URL="https://en.wikipedia.org/wiki/Continued_fraction"]regular continued fraction[/URL] of a number from it's floating-point representation (a file containing hex or dec digits). Just like y-cruncher, it's features include:
[LIST][*]Ability to crunch billions of terms in reasonable time[*]Advanced algorithms for log-linear runtime[*]Ability to utilize hard-disk to perform extremely large calculations[*]Ability to automatically save and resume partial computations[*]Multi-threading[/LIST]Zuuv has been utilized to break world records for computation of regular continued fraction terms of important mathematical constants such as Pi, Euler-Mascheroni etc, all done on a regular PC (i5 9300H, 8GB RAM). Link to repository: [URL]https://github.com/sinandredemption/zuuv[/URL] Link to Windows builds (for modern processors): [URL]https://github.com/sinandredemption/zuuv/tree/main/builds/modern[/URL] Please free to ask questions and put out suggestions or constructive criticism. Or contact me personally if you are interested in running a sizeable computation. [B]Disclaimer[/B]: The author of this post is also the author of Zuuv, and Zuuv is not affiliated in any way with y-cruncher or A. Yee himself. PS I am posting this because I thought more of you should know about Zuuv. In case this qualifies as spam, please inform me and I will delete this post. [color=red][b]MODERATOR NOTE: This post started another thread. It was on the same topic as this thread. I merged that thread into this one. Starting new threads on the same topic as threads you previously started ("multiposting"), is considered bad behavior on this Forum. It recently got another user banned.[/b][/color][/QUOTE]it is a real shame that Liunux is no longer supported. What is broken with respect to Linux? Do the Windoze builds work under WINE? |

All times are UTC. The time now is 20:10. |

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.