Skip to main content
SpringerLink
Log in

The number of steps in a finite JACOBI algorithm

  • Published:
manuscripta mathematica Aims and scope Submit manuscript

Abstract

Let x=(x1,...,xn) be a rational point and denote by L(x) the length of thefinite JACOBI algorithm associated with x. Let b(x) be the minimal common denominator of x. Then L(x)=const, log b(x) is true in a certain sense for almost all x.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. DIXON, J.D.: The number of steps in the Euclidean algorithm. J.Number Theory2 (1970), 414–422.

    Google Scholar 

  2. DIXON, J.D.: A simple estimate for the number of steps in the Euclidean algorithm. Amer.Math.Monthly78 (1971), 374–376.

    Google Scholar 

  3. FISCHER, R.: Konvergenzgeschwindigkeit beim Jacobi-algorithmus. Österreichische Akademie Wiss.Anzeiger der math.naturw.Kl. 1972, 156–158.

  4. FISCHER, R.: Ergodische Theorie von Ziffernentwicklungen in Wahrscheinlichkeitsräumen. Math.Z.128 (1972), 217–230.

    Google Scholar 

  5. HEILBRONN, H.: On the average length of a class of finite continued fractions. In: Abhandlungen Zahlentheorie und Analysis. Berlin-New York 1968 (Herausgegeben von P. TURAN 87–96.

  6. PERRON, O.: Grundlagen für eine Theorie des Jacobischen Algorithmus. Math.Ann.64 (1907), 1–76

    Google Scholar 

  7. PHILIPP, W.: Das Gesetz vom iterierten Logarithmus mit Anwendungen auf die Zahlentheorie. Math.Ann.180 (1969), 75–94 und Corrigendum dazu, ibid.190 (1971), 338.

    Google Scholar 

  8. PHILIPP, W.: Ein zentraler Grenzwertsatz mit Anwendungen auf die Zahlentheorie. Z. Wahrscheinlichkeitstheorie verw.Geb.8 (1967), 185–203.

    Google Scholar 

  9. SCHWEIGER, F.: The metrical theory of JACOBI-PERRON algorithm. Lecture Notes in Mathematics334. Berlin-Heidelberg-New York: Springer 1973.

    Google Scholar 

  10. SCHWEIGER, F.: An estimate for the length of a finite JACOBI algorithm. To appear in ....

  11. TONKOV, T.: On the average length of finite continued fractions. Acta Arithm.26 (1974), 47–57.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrkanzel Mathematik der Hochschule für Bildungswissenschaften, Hochschulstraße 67, A-9010, Klagenfurt

    Roland Fischer

  2. Institut für Mathematik der Universität Salzburg, Petersbrunnstraße 19, A-5020, Salzburg

    Fritz Schweiger

Authors
  1. Roland Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fritz Schweiger
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fischer, R., Schweiger, F. The number of steps in a finite JACOBI algorithm. Manuscripta Math 17, 291–308 (1975). https://doi.org/10.1007/BF01170314

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01170314

Keywords

Search

Navigation