David G. Moursund – Communications of the ACM

Research and Advances Jun 1 1995

Site-based management: saving our schools

Computing Applications

Author Archives

Research and Advances Mar 1 1984

Preparing precollege teachers for the computer age

Computing Applications

Research and Advances Jul 1 1967

Optimal starting values for Newton-Raphson calculation of x1 2

The problem of obtaining starting values for the Newton-Raphson calculation of √x on a digital computer is considered. It is shown that the conventionally used best uniform approximations to √x do not provide optimal starting values. The problem of obtaining optimal starting values is stated, and several basic results are proved. A table of optimal polynomial starting values is given.

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved