Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Continued Fraction algorithm #9

Open
ghost opened this issue Aug 23, 2018 · 0 comments
Open

Continued Fraction algorithm #9

ghost opened this issue Aug 23, 2018 · 0 comments

Comments

@ghost
Copy link

ghost commented Aug 23, 2018

The current, bespoke, algorithm for computing the infinite part of the Continued Fraction allows the code to easily guarantee that the desired precision is maintained. It's very slow though.

Find a way to combine the current method with the built in Continued Fraction algorithm (which is much faster) to speed up the calculation.

@ghost ghost added the enhancement label Aug 23, 2018
@ghost ghost self-assigned this Aug 23, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

0 participants