A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers (Q1895406): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jsco.1995.1009 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2063001983 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:43, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers |
scientific article |
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