Efficient computing of n-dimensional simultaneous Diophantine approximation problems
By: Attila Kovács and Norbert Tihanyi
Abstract
In this paper we consider two algorithmic problems of simultaneous Diophantine approximations. The first algorithm produces a full solution set for approximating an irrational number with rationals with common denominators from a given interval. The second one aims at finding as many simultaneous solutions as possible in a given time unit. All the presented algorithms are implemented, tested and the PariGP version made publicly available.
DOI: https://doi.org/10.2478/ausi-2014-0002 | Journal eISSN: 2066-7760
Language: English
Page range: 16 - 34
Submitted on: Apr 10, 2013
Published online: May 30, 2014
Published in print: Jul 1, 2013
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Keywords:
Related subjects:
© 2014 Attila Kovács, Norbert Tihanyi, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
