LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A Lochs-Type Approach via Entropy in Comparing the Efficiency of Different Continued Fraction Algorithms

Photo by kellysikkema from unsplash

We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aim to… Click to show full abstract

We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aim to compare the efficiency by describing the rate at which the digits of one number-theoretic expansion determine those of another. We study Chan’s continued fractions, θ-expansions, N-continued fractions, and Rényi-type continued fractions. A central role in fulfilling our goal is played by the entropy of the absolutely continuous invariant probability measures of the associated dynamical systems.

Keywords: continued fractions; type approach; lochs type; continued fraction; efficiency

Journal Title: Mathematics
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.