An integer based square root algorithm (Q688630): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Automatic Computation of Exponentials, Logarithms, Ratios and Square Roots / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3922157 / rank | |||
Normal rank | |||
Revision as of 10:25, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An integer based square root algorithm |
scientific article |
Statements
An integer based square root algorithm (English)
0 references
28 November 1993
0 references
The square root for integer numbers is computed bit after bit, i.e. the bisection method is used. Here only additions and shifts are required. The reviewer is surprised that this method is faster than Newton's method for 48-bit numbers and a 32-bit Motorola 68000 micro processor.
0 references
square root algorithm
0 references
bisection method
0 references
Newton's method
0 references
