A fast computation of the best \(k\)-digit rational approximation to a real number
From MaRDI portal
Publication:346908
DOI10.1007/s00009-016-0747-zzbMath1355.65038OpenAlexW2414946551MaRDI QIDQ346908
Maurizio Citterio, Raffaella Pavani
Publication date: 30 November 2016
Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00009-016-0747-z
Best approximation, Chebyshev systems (41A50) Computation of special functions and constants, construction of tables (65D20) Continued fractions (11A55) Approximation to limiting values (summation of series, etc.) (40A25) Farey sequences; the sequences (1^k, 2^k, dots) (11B57)
Related Items (2)
Birkhoff averages and rotational invariant circles for area-preserving maps ⋮ A fast computation of the best \(k\)-digit rational approximation to a real number
Cites Work
- A fast computation of the best \(k\)-digit rational approximation to a real number
- Approximating a real number by a rational number with a limited denominator: a geometric approach
- Conjugating the Poincaré-map to a rotation
- A numerical approximation of the rotation number
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A fast computation of the best \(k\)-digit rational approximation to a real number
