Comparison of various generalizations of continued fractions
Matematičeskie zametki, Tome 61 (1997) no. 3, pp. 339-348
Voir la notice de l'article provenant de la source Math-Net.Ru
We use the Euler, Jacobi, Poincaré, and Brun matrix algorithms as well as two new algorithms to evaluate the continued fraction expansions of two vectors $L$ related to two Davenport cubic forms $g_1$ and $g_2$. The Klein polyhedra of $g_1$ and $g_2$ were calculated in another paper. Here the integer convergents $P_k$ given by the cited algorithms are considered with respect to the Klein polyhedra. We also study the periods of these expansions. It turns out that only the Jacobi and Bryuno algorithms can be regarded as satisfactory.
@article{MZM_1997_61_3_a2,
author = {A. D. Bruno and V. I. Parusnikov},
title = {Comparison of various generalizations of continued fractions},
journal = {Matemati\v{c}eskie zametki},
pages = {339--348},
publisher = {mathdoc},
volume = {61},
number = {3},
year = {1997},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1997_61_3_a2/}
}
A. D. Bruno; V. I. Parusnikov. Comparison of various generalizations of continued fractions. Matematičeskie zametki, Tome 61 (1997) no. 3, pp. 339-348. http://geodesic.mathdoc.fr/item/MZM_1997_61_3_a2/