Optimal starting approximations for generating square root for slow or no divide
From MaRDI portal
Publication:5595541
DOI10.1145/362736.362750zbMath0198.49502OpenAlexW2020187420MaRDI QIDQ5595541
Publication date: 1970
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/362736.362750
Related Items (4)
Optimal absolute error starting values for Newton-Raphson calculation of square root ⋮ Evaluation of functions on microcomputers: square root ⋮ A recurrence relation for the square root ⋮ Choosing starting values for certain Newton-Raphson iterations
This page was built for publication: Optimal starting approximations for generating square root for slow or no divide