๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Analysis of Lehmer's GCD algorithm. ISSAC95

โœ Scribed by Sorenson.

Book ID
127401452
Tongue
English
Weight
126 KB
Category
Library
ISBN-13
9780897916998

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Double-Digit Lehmer-Euclid Algorithm f
A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers
โœ Tudor Jebelean ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 316 KB

The use of pairs of double digits in the Lehmer-Euclid multiprecision GCD algorithm halves the number of long multiplications, but a straightforward implementation of this idea does not give the desired speed-up. We show how to overcome the practical difficulties by using an enhanced condition for e

Analysis of a Left-Shift Binary GCD Algo
Analysis of a Left-Shift Binary GCD Algorithm
โœ Jeffrey Shallit; Jonathan Sorenson ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 385 KB

We introduce a new left-shift binary algorithm, LSBGCD, for computing the greatest common divisor of two integers, and we provide an analysis of the worst-case behavior of this algorithm. The analysis depends on a theorem of Ramharter about the extremal behavior of certain continuants.