Skip to Main content Skip to Navigation
New interface
Conference papers

The Lyapunov tortoise and the dyadic hare

Benoît Daireaux 1 Véronique Maume-Deschamps 2 Brigitte Vallée 1 
1 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
Abstract : 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.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 3:52:48 PM
Last modification on : Friday, November 25, 2022 - 10:12:06 AM
Long-term archiving on: : Friday, November 13, 2015 - 11:40:57 AM


Publisher files allowed on an open archive



Benoît Daireaux, Véronique Maume-Deschamps, Brigitte Vallée. The Lyapunov tortoise and the dyadic hare. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.71-94, ⟨10.46298/dmtcs.3372⟩. ⟨hal-01184044⟩



Record views


Files downloads