Comparison of various generalizations of continued fractions (Q1274103): Difference between revisions

The authors compare several generalizations of the concept of a continued fraction, connected with a matrix type formulation of rational approximants to a pair of numbers \(\alpha/\gamma, \beta/\gamma\) [connected with linear forms for the triple \((\alpha, \beta, \gamma)\)]. The algorithms can be given by products of \(3\times 3\) matrices with integer coefficients (just like the products of \(2\times 2\) integer matrices for ordinary continued fractions). The authors state (Remark 7) that the original version of the paper was published as preprint No. 52 (in Russian) at the Institute of Applied Mathematics, Moscow (1994); here the results are stated without proofs. The comparison of the 6 algorithms (Euler, Jacobi, Poincaré, Brun, Bryuno, Parusnikov) is based on the performance with respect to two examples, studied in a previous paper by the authors [\textit{A. D. Bryuno} and \textit{V. I. Parusnikov}, Math. Notes 56, No. 4, 994-1007 (1994); translation from Mat. Zametki 56, No. 4, 9-27 (1994; Zbl 0844.11047)]. The tables showing the information to discern between the different algorithms are not given in the paper under review, for those the reader is referred to the preprint mentioned above or they can be obtained by email from bruno\@applmat.msk.su.