Given a real number α, we aim at computing the best rational approximation with at most k digits and with exactly k digits at the numerator (denominator). Our approach exploits Farey sequences. Our method turns out to be very fast in the sense that, once the development of α in continued fractions is available, the required operations are just a few and their number remains essentially constant for any k (in double precision finite arithmetic). Estimations of error bounds are also provided.

A Fast Computation of the Best k -Digit Rational Approximation to a Real Number

CITTERIO, MAURIZIO GIOVANNI;PAVANI, RAFFAELLA
2016

Abstract

Given a real number α, we aim at computing the best rational approximation with at most k digits and with exactly k digits at the numerator (denominator). Our approach exploits Farey sequences. Our method turns out to be very fast in the sense that, once the development of α in continued fractions is available, the required operations are just a few and their number remains essentially constant for any k (in double precision finite arithmetic). Estimations of error bounds are also provided.
Best rational approximation with k digits; Continued fractions; Farey sequences; Mathematics (all)
File in questo prodotto:
File Dimensione Formato  
citteriopavani.pdf

accesso aperto

: Publisher’s version
Dimensione 383.53 kB
Formato Adobe PDF
383.53 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11311/1007527
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 2
social impact