Optimal starting approximations for generating square root for slow or no divide
- 1 September 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 13 (9) , 559-560
- https://doi.org/10.1145/362736.362750
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The logarithmic error and Newton's method for the square rootCommunications of the ACM, 1969
- Computational Aspects of Chebyshev Approximation Using a Generalized Weight FunctionSIAM Journal on Numerical Analysis, 1968
- Optimal starting values for Newton-Raphson calculation of √x ½Communications of the ACM, 1967
- Chebyshev Approximation Using a Generalized Weight FunctionSIAM Journal on Numerical Analysis, 1966
- The generation of square roots on a computer with rapid multiplication compared with divisionMathematics of Computation, 1965