Sign inSign in

Continued fractions for rational reconstruction

An algorithmic approach, similar to the Euclidean GCD algorithm, used to find the exact rational representation of an optimal solution given its high-precision binary approximation.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Continued fractions1Euclidean GCD algorithm1Rational numbers1

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.