Further analysis of the binary Euclidean algorithm
Data Structures and Algorithms
2013-03-13 v1
Abstract
The binary Euclidean algorithm is a variant of the classical Euclidean algorithm. It avoids multiplications and divisions, except by powers of two, so is potentially faster than the classical algorithm on a binary machine. We describe the binary algorithm and consider its average case behaviour. In particular, we correct some errors in the literature, discuss some results of Vall\'ee, and describe a numerical computation which supports a conjecture of Vall\'ee.
Keywords
Cite
@article{arxiv.1303.2772,
title = {Further analysis of the binary Euclidean algorithm},
author = {Richard P. Brent},
journal= {arXiv preprint arXiv:1303.2772},
year = {2013}
}
Comments
An old Technical Report which no longer seems to be available from the Oxford University website