Optimal Starting Approximations for Generating
Square Root for Slow or No Divide

On machine with slow or no division, it is preferable to
use an iterative scheme for the square root different from
the classical Heron scheme.  The problem of optimal initial 
approximants is considered, and some optimal polynomial initial 
approximations are tabulated.

CACM September, 1970

Wilson, M. W.

square root, Newton-Raphson iteration, optimal approximants

5.13

CA700906 JB February 10, 1978  1:33 PM

1832	4	1999
1999	4	1999
2159	4	1999
1932	5	1999
1999	5	1999
1999	5	1999
1999	5	1999