The quality of approximation of Brun's algorithm in three dimensions

DOI10.1007/S006050170004MaRDI QIDQ5957813zbMATH OpenOpenAlexFDO

Authors B. R. Schratzberger

Publication date 16 June 2003

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s006050170004

zbMATH Keywords

approximationBrun's algorithmcontinued fraction algorithmsergodic theory

Mathematics Subject Classification ID

Continued fractions (11A55) Continued fractions and generalizations (11J70) Metric theory (11J83) Metric theory of continued fractions (11K50)

Review text

This paper describes the quality of approximation of Brun's algorithm in dimension three, showing the exponent of convergence is \(1+d\). That is, there is a constant \(d>0\) such that for almost all \((x_1,x_2,x_3)\) there is a \(t\geq t(x)\) such that \(|x_i-p_i^{(t)}/q_i^{(t)}|\leq 1/(q^{(t)})^{1+d}\).

Recommendations

• scientific article; zbMATH DE number 2063929
• The exponent of convergence for 2-dimensional Jacobi-Perron type algorithms
• Exponents for three-dimensional simultaneous Diophantine approximations.
• Volume as a measure of approximation for the Jacobi-Perron algorithm
• scientific article; zbMATH DE number 3968681

Cited in

(7)

• What do continued fractions accomplish?
• Bispecial factors in the Brun S-adic system
• scientific article; zbMATH DE number 3968681 (Why is no real title available?)
• scientific article; zbMATH DE number 2063929 (Why is no real title available?)
• On the second Lyapunov exponent of some multidimensional continued fraction algorithms
• Multidimensional continued fractions and symbolic codings of toral translations
• Rational approximations, multidimensional continued fractions, and lattice reduction

This page was built for publication: The quality of approximation of Brun's algorithm in three dimensions

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