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

A Fast Euclidean Algorithm for Gaussian Integers

โœ Scribed by George E. Collins

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
187 KB
Volume
33
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

A Fast and Numerically Stable Euclidean-
A Fast and Numerically Stable Euclidean-like Algorithm for Detecting Relatively Prime Numerical Polynomials
โœ B. Beckermann; G. Labahn ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 644 KB

In this paper we provide a fast, numerically stable algorithm to determine when two given polynomials a and b are relatively prime and remain relatively prime even after small perturbations of their coefficients. Such a problem is important in many applications where input data are only available up

A Fast Algorithm for Particle Simulation
A Fast Algorithm for Particle Simulations
โœ L. Greengard; V. Rokhlin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 407 KB

We restrict our attention in this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potenti