<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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.</p></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.

Efficient computing of n-dimensional simultaneous Diophantine approximation problems

Eötvös Loránd University Faculty of Informatics

Acta Universitatis Sapientiae, Informatica

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

In this paper we consider two algorithmic problems of simultaneous Diophantine approximations. The first algorithm produces a full solution set for...

Efficient computing of n-dimensional simultaneous Diophantine approximation problems

Publié en ligne: 30 mai 2014

Pages: 16 - 34

Reçu: 10 avr. 2013

DOI: https://doi.org/10.2478/ausi-2014-0002

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.