Finding simultaneous Diophantine approximations with prescribed quality
Number Theory
2010-01-26 v1
Abstract
We give an algorithm that finds a sequence of approximations with Dirichlet coefficients bounded by a constant only depending on the dimension. The algorithm uses the LLL-algorithm for lattice basis reduction. We present a version of the algorithm that runs in polynomial time of the input.
Cite
@article{arxiv.1001.4455,
title = {Finding simultaneous Diophantine approximations with prescribed quality},
author = {Wieb Bosma and Ionica Smeets},
journal= {arXiv preprint arXiv:1001.4455},
year = {2010}
}
Comments
16 pages, 7 figures