Analysis of the Brun Gcd Algorithm
Abstract
We introduce and study a multiple gcd algorithm that is a natural extension of the usual Euclid algorithm, and coincides with it for two entries; it performs Euclidean divisions, between the largest entry and the second largest entry, and then re-orderings. This is the discrete version of a multidimensional continued fraction algorithm due to Brun. We perform the average-case analysis of this algorithm, and prove that the mean number of steps is linear with respect to the size of the entry. The method relies on dynamical analysis, and is based on the study of the underlying Brun dynamical system. The dominant constant of the analysis is related to the entropy of the system. We also compare this algorithm to another extension of the Euclid algorithm, proposed by Knuth, and already analyzed by the authors.
References
[1]
P. Arnoux and A. Nogueira. Mesures de Gauss pour des algorithmes de fractions continues multidimensionnelles. Ann. Sci. Ecole Norm. Sup., 26:645--664, 1993.
[2]
V. Baladi and B. Vallée. Euclidean algorithms are Gaussian. Journal Number Theory, 110:331--386, 2006.
[3]
V. Berthé, J. Bourdon, T. Jolivet, and A. Siegel. Generating discrete planes with substitutions. In Combinatorics on words, volume 8079 of LNCS, pages 58--70. Springer, 2013.
[4]
V. Berthé, L. Lhote, and B. Vallée. Probabilistic analyses of the plain multiple gcd algorithm. Journal of Symbolic Computation, 74:425--474, 2016.
[5]
A. Broise-Alamichel and Y. Guivarc'h. Exposants caractéristiques de l'algorithme de Jacobi-Perron et de la transformation associée. Annales de l'Institut Fourier, 51(3):565--686, 2001.
[6]
V. Brun. Algorithmes euclidiens pour trois et quatre nombres. In 13e congrès des mathématiciens scandinaves, Helsinki 1957, pages 45--64.
[7]
D. M. Hardcastle and K. Khanin. On almost everywhere strong convergence of multi-dimensional continued fraction algorithms. Ergodic Theory Dynam. Systems, 20(6):1711--1733, 2000.
[8]
D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, 3rd edition, 1998.
[9]
J. Lagarias. The quality of the diophantine approximations found by the Jacobi-Perron algorithm, and related algorithms. Mh. Math, 115:299--328, 1993.
[10]
L. Lhote and B. Vallée. Gaussian laws for the main parameters of the Euclid algorithms. Algorithmica, 50(4):497--554, 2008.
[11]
B. S. Majewski and G. Havas. A solution to the extended GCD problem. In ISSAC95, pages 248--253.
[12]
F. Schweiger. Multidimensional continued fractions. Oxford University Press, 2000.
[13]
B. Vallée. Euclidean dynamics. Discrete and Continuous Dynamical Systems, 1(15):281--352, 2006.
Index Terms
- Analysis of the Brun Gcd Algorithm
Recommendations
Probabilistic analyses of the plain multiple gcd algorithm
Among multiple gcd algorithms on polynomials as on integers, one of the most natural ones performs a sequence of - 1 phases ( is the number of inputs), with each of them being the Euclid algorithm on two entries. We present here a complete probabilistic ...
Multiple GCDs. probabilistic analysis of the plain algorithm
ISSAC '13: Proceedings of the 38th International Symposium on Symbolic and Algebraic ComputationThis paper provides a probabilistic analysis of an algorithm which computes the gcd of ℓ inputs (with ℓ ≥ 2), with a succession of ℓ - 1 phases, each of them being the Euclid algorithm on two entries. This algorithm is both basic and natural, and two ...
Gaussian Laws for the Main Parameters of the Euclid Algorithms
We provide sharp estimates for the probabilistic behaviour of the main parameters of the Euclid Algorithms, both on polynomials and on integer numbers. We study in particular the distribution of the bit-complexity which involves two main parameters: ...
Comments
Information & Contributors
Information
Published In
July 2016
434 pages
ISBN:9781450343800
DOI:10.1145/2930889
- General Chairs:
- Sergei Abramov,
- Eugene Zima,
- Program Chair:
- Xiao-Shan Gao
Copyright © 2016 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 July 2016
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- AleaEnAmSud AmSud-STIC Project.
- ANR DynA3S (ANR-13-BS02-0003)
Conference
ISSAC '16
Sponsor:
ISSAC '16: International Symposium on Symbolic and Algebraic Computation
July 20 - 22, 2016
ON, Waterloo, Canada
Acceptance Rates
Overall Acceptance Rate 395 of 838 submissions, 47%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 57Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 27 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in