On one algorithm for searching the best joint diophantine approximations
https://doi.org/10.22405/2226-8383-2021-22-5-346-349
Abstract
The article discusses the issue of improving one algorithm for finding the best joint Diophantine approximations and estimating its complexity.
About the Authors
Yurij Aleksandrovich Basalov
Tula State Lev Tolstoy Pedagogical University
Russian Federation
Russian Federation
Anastasia Nikolaevna Basalova
Tula State Lev Tolstoy Pedagogical University
Russian Federation
Russian Federation
References
1. Basalov Yu. A., Pacukova A. N. 2012, “On some questions in Diophanite approximations“, Chebyshevskii sbornik, Vol. 13, Issue 3, pp. 4–27.
2. Bruno A. D. 2015, “Universal generalization of the continued fraction algorithm“, Chebyshevskii sbornik, Vol. 16, Issue 2, pp. 35–65.
3. Schmidt W. M. 1983, Diophantine Approximation, Mir.
Review
For citations:
Basalov Yu.A., Basalova A.N. On one algorithm for searching the best joint diophantine approximations. Chebyshevskii Sbornik. 2021;22(5):346-349. (In Russ.) https://doi.org/10.22405/2226-8383-2021-22-5-346-349
Views:
318
Email this article 