scientific article; zbMATH DE number 4004276

From MaRDI portal
Publication:3755515





This work is an important contribution to the theory of multidimensional continued fractions. It deals with four algorithms: Brun's algorithm, the division form of Brun's algorithm and its transposed algorithm [which is the dual in the sense of metrical theory; see e.g. \textit{Shunji Ito}, Tokyo J. Math. 9, 115-133 (1986; Zbl 0606.10042)], and Greiter's modification of Selmer's algorithm. It is shown that these algorithms are uniformly convergent and estimates for the convergence rate are given. The case \(n=2\) is given special attention. Here and later on computer assistance was used to give the necessary estimates on determinants. This proof is similar to Paley and Ursell's method for the Jacobi algorithm as presented in the reviewer's monograph [The metrical theory of Jacobi- Perron algorithm (Lect. Notes Math. 334) (1973; Zbl 0287.10041)]. The general case should be compared with Fischer's elegant method (also presented in Schweiger 1973). Next, problems of periodicity are touched on. Here a newly developed high precision arithmetic is used as an explorative tool. The result of \textit{E. Dubois} and \textit{R. Paysant Le Roux} [C. R. Acad. Sci., Paris, Sér. A 272, 649-652 (1971; Zbl 0207.054)] on the existence of periodic pairs in cubic fields can be extended in special cases. Furthermore the question whether linear dependence can be detected is discussed.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755515)