Optimal absolute error starting values for Newton-Raphson calculation of square root

DOI10.1007/BF02239012zbMath0719.65041WikidataQ60350230 ScholiaQ60350230MaRDI QIDQ2640319

M. Mezzalama, P. Montuschi

Publication date: 1991

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

Newton-Raphson methodsquare rootsoptimal absolute error starting valuesprescribed number of iterations

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Numerical computation of solutions to single equations (65H05)

Related Items

Optimal initial approximations for the Newton-Raphson division algorithm, Reciprocal and reciprocal square root units with operand modification and multiplication, Complex square root with operand prescaling, Choosing starting values for certain Newton-Raphson iterations

Cites Work

• Unnamed Item
• Unnamed Item
• On the computation of rational approximations to continuous functions
• Square-Rooting Algorithms for High-Speed Digital Circuits
• Uniform rational approximation of functions of several variables
• Starting approximations for square root calculation on IBM system /360
• Optimal starting values for Newton-Raphson calculation of √x ^½
• Optimal starting approximations for generating square root for slow or no divide
• Best Rational Starting Approximations and Improved Newton Iteration for the Square Root
• Generalized Logarithmic Error and Newton's Method for the mth Root