Optimal starting approximations for generating square root for slow or no divide

Authors:
M. Wayne Wilson
Affiliations:
IBM Scientific Center, Houston, TX
Venue:
Communications of the ACM
Year:
1970

Citing 2
Cited 3

The logarithmic error and Newton's method for the square root

Communications of the ACM
Optimal starting values for Newton-Raphson calculation of x1 2

Communications of the ACM

Computation of √x

Proceedings of the 1999 ACM symposium on Applied computing
Choosing starting values for certain Newton-Raphson iterations

Theoretical Computer Science - Real numbers and computers
Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication

IEEE Transactions on Computers

Quantified Score

Hi-index	48.22

Visualization

Abstract