论文信息 - Improving the Multiprecision Euclidian Algorithm

Improving the Multiprecision Euclidian Algorithm

We improve the implementation of Lehmer-Euclid algorithm for multiprecision integer GCD computation by partial cosequence computation on pairs of double digits, enhanced condition for exiting the partial cosequence computation, and approximative GCD computation. The combined effect of these improvements is an experimentally measured speed-up by a factor of 2 over the currently used implementation.

Tudor Jebelean

[1] Kenneth Weber,et al. The accelerated integer GCD algorithm , 1995, TOMS.

[2] D. H. Lehmer. Euclid's Algorithm for Large Numbers , 1938 .

[3] Tudor Jebelean. Comparing several GCD algorithms , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[4] Tudor Jebelean,et al. A generalization of the binary GCD algorithm , 1993, ISSAC '93.

[5] Jean Della Dora,et al. Computer Algebra and Parallelism , 1989, Lecture Notes in Computer Science.

[6] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[7] B. Buchberger. An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[8] J. Stein. Computational problems associated with Racah algebra , 1967 .

[9] Jonathan P. Sorenson. Two Fast GCD Algorithms , 1994, J. Algorithms.

[10] Winfried Neun,et al. Very Large Gröbner Basis Calculations , 1990, CAP.

[11] James H. Davenport,et al. P-adic reconstruction of rational numbers , 1982, SIGS.

[12] Robert T. Moenck,et al. Fast computation of GCDs , 1973, STOC.