A fast Euclidean algorithm for Gaussian integers (Q1600038)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast Euclidean algorithm for Gaussian integers |
scientific article; zbMATH DE number 1754161
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast Euclidean algorithm for Gaussian integers |
scientific article; zbMATH DE number 1754161 |
Statements
A fast Euclidean algorithm for Gaussian integers (English)
0 references
11 June 2002
0 references
Euclid's algorithm with Gaussian integers is carried out using approximate division (leading parts only). Often the quotient has small components, and then addition and shifting can be used instead of multiplication, thereby speeding up the process. Experiments with randomly chosen numbers are reported, with tables showing the improvement obtained.
0 references
Euclid's algorithm
0 references
Gaussian integers
0 references
0 references
