A fast Euclidean algorithm for Gaussian integers (Q1600038): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:44, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast Euclidean algorithm for Gaussian integers |
scientific article |
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
