Approximating rational numbers by fractions

Authors:
Michal Forišek
Affiliations:
Department of Informatics, Faculty of Mathematics, Physics and Informatics, Comenius University, Bratislava, Slovakia
Venue:
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Year:
2007

Citing 2
Cited 0

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show a polynomial-time algorithm to find the best rational approximation of a given rational number within a given interval. As a special case, we show how to find the best rational number that after evaluating and rounding exactly matches the input number. In both results, "best" means "having the smallest possible denominator".