Skip to content

Continued Fraction algorithm #9

@ghost

Description

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.

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions