On one algorithm for searching the best joint Diophantine approximations
Čebyševskij sbornik, Tome 22 (2021) no. 5, pp. 346-349
Cet article a éte moissonné depuis la source Math-Net.Ru
The article discusses the issue of improving one algorithm for finding the best joint Diophantine approximations and estimating its complexity.
Keywords:
Diophanite approximations, searching best joint diophantine approximations.
@article{CHEB_2021_22_5_a23,
author = {Yu. A. Basalov and A. N. Basalova},
title = {On one algorithm for searching the best joint {Diophantine} approximations},
journal = {\v{C}eby\v{s}evskij sbornik},
pages = {346--349},
year = {2021},
volume = {22},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/CHEB_2021_22_5_a23/}
}
Yu. A. Basalov; A. N. Basalova. On one algorithm for searching the best joint Diophantine approximations. Čebyševskij sbornik, Tome 22 (2021) no. 5, pp. 346-349. http://geodesic.mathdoc.fr/item/CHEB_2021_22_5_a23/
[1] Basalov Yu. A., Patsukova A. N., “O nekotorykh voprosakh diofantovykh priblizhenii”, Chebyshevskii sbornik, 13:3 (2012), 4–27 | Zbl
[2] Bryuno A. D., “Universalnoe obobschenie algoritma tsepnoi drobi”, Chebyshevskii sbornik, 16:2 (2015), 35–65 | MR | Zbl
[3] Shmidt V. M., Diofantovy priblizheniya, Per. s angl., Mir, M., 1983