On the Number of Divisions of the Euclidean Algorithm Applied to Gaussian Integers
Journal of Symbolic Computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
(1+i)-ary GCD computation in Z[i] as an analogue to the binary GCD algorithm
Journal of Symbolic Computation
Asymptotically Fast GCD Computation in Z[i]
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Algorithms for Gaussian integer arithmetic
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
Journal of Symbolic Computation
| Hi-index | 0.00 |
A new version of the Euclidean algorithm is developed for computing the greatest common divisor of two Gaussian integers. It uses approximation to obtain a sequence of remainders of decreasing absolute values. The algorithm is compared with the new (1+i)-ary algorithm of Weilert and found to be somewhat faster if properly implemented.