A fast Euclidean algorithm for Gaussian integers (Q1600038): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: H. J. Godwin / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: H. J. Godwin / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094096244 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3916662 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Computing Time of the Euclidean Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4398780 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of divisions of the Euclidean algorithm applied to Gaussian integers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2739476 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:30, 4 June 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
0 references
