A generalization of the simple continued fraction algorithm
HTML articles powered by AMS MathViewer
- by Theresa P. Vaughan PDF
- Math. Comp. 32 (1978), 537-558 Request permission
Abstract:
In this paper we present a generalization of the continued fraction algorithm, based on a geometric and matrix-theoretic approach. We first give a geometric representation in the plane ${R^2}$, of the simple continued fraction algorithm, described in terms of geometric and arithmetic properties of $2 \times 2$ matrices with nonnegative integer entries and determinant 1. The algorithm of this paper is then derived as a natural generalization of the situation in ${R^2}$. We describe a computational procedure for our algorithm, and give several examples.References
- Leon Bernstein, The Jacobi-Perron algorithm—Its theory and application, Lecture Notes in Mathematics, Vol. 207, Springer-Verlag, Berlin-New York, 1971. MR 0285478 C. D. OLDS, Continued Fractions, Math. Assoc. Amer., New Mathematical Library, 1963. HARRIS HANCOCK, Development of the Minkowski Geometry of Numbers, Dover, New York, 1964.
Additional Information
- © Copyright 1978 American Mathematical Society
- Journal: Math. Comp. 32 (1978), 537-558
- MSC: Primary 10F20; Secondary 10A30
- DOI: https://doi.org/10.1090/S0025-5718-1978-0480367-5
- MathSciNet review: 0480367