A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers (Q1895406)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 786280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers |
scientific article; zbMATH DE number 786280 |
Statements
A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers (English)
0 references
7 March 1996
0 references
This paper discusses several useful techniques for improving the performance of \textit{D. H. Lehmer}'s multiprecision algorithm for computing greatest common divisors [Am. Math. Mon. 45, 227--233 (1938; Zbl 0018.29204)]. The result is an algorithm that is approximately twice as fast as the original on inputs of 100 32-bit words in length, a significant improvement. The techniques developed include using double digits, using a new, exact condition for the partial cosequence computation, and an approximative GCD computation. Jebelean's exact condition was subsequently used by the reviewer [Proc. ISSAC '95, 254--258 (1995)].
0 references
Euclidean algorithm
0 references
number-theoretic algorithms
0 references
greatest common divisors
0 references
double digits
0 references
partial cosequence computation
0 references
approximative GCD computation
0 references
0.8460678458213806
0 references
0.8459251523017883
0 references
0.8459251523017883
0 references
0.8058869242668152
0 references
