Benoît Daireaux ; Véronique Maume-Deschamps ; Brigitte Vallée - The Lyapunov tortoise and the dyadic hare

dmtcs:3372 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms -
The Lyapunov tortoise and the dyadic hare

Authors: Benoît Daireaux 1; Véronique Maume-Deschamps ORCID-iD2; Brigitte Vallée ORCID-iD1

  • 1 Equipe AMACC - Laboratoire GREYC - UMR6072
  • 2 Institut de Mathématiques de Bourgogne [Dijon]

We study a gcd algorithm directed by Least Significant Bits, the so―called LSB algorithm, and provide a precise average―case analysis of its main parameters [number of iterations, number of shifts, etc...]. This analysis is based on a precise study of the dynamical systems which provide a continuous extension of the algorithm, and, here, it is proved convenient to use both a 2―adic extension and a real one. This leads to the framework of products of random matrices, and our results thus involve a constant $γ$ which is the Lyapunov exponent of the set of matrices relative to the algorithm. The algorithm can be viewed as a race between a dyadic hare with a speed of 2 bits by step and a "real'' tortoise with a speed equal to $γ /\textit{log} \ 2 \sim 0.05$ bits by step. Even if the tortoise starts before the hare, the hare easily catches up with the tortoise [unlike in Aesop's fable [Ae]\ldots], and the algorithm terminates.

Volume: DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: greatest common divisor,average case analysis,LSB algorithm,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1137/1.9781611972979.14
  • 10.1137/1.9781611972979.14
  • 10.1137/1.9781611972979.14
Analysis of fast versions of the euclid algorithm

2 Documents citing this article

Consultation statistics

This page has been seen 153 times.
This article's PDF has been downloaded 156 times.