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

DOI10.1007/BF02239012MaRDI QIDQ2640319zbMATH OpenWikidataFDO

Authors P. Montuschi, M. Mezzalama

Publication date 1991

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02239012

zbMATH Keywords

Newton-Raphson methodoptimal absolute error starting valuesprescribed number of iterationssquare roots

Mathematics Subject Classification ID

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

Review text

The authors discuss the problem of optimal starting values for the Newton-Raphson calculation of square roots under the condition of optimization of the absolute error after a given number of iterations.

Recommendations

• scientific article; zbMATH DE number 3945240
• Optimal initial approximations for the Newton-Raphson division algorithm
• On the problem of starting points for iterative methods
• Calculating the square root with arbitrary order of convergence
• Optimal value for the Newton-Raphson division algorithm

Cites work

• Best Rational Starting Approximations and Improved Newton Iteration for the Square Root
• Generalized Logarithmic Error and Newton's Method for the mth Root
• scientific article; zbMATH DE number 3864371 (Why is no real title available?)
• scientific article; zbMATH DE number 3304439 (Why is no real title available?)
• On the computation of rational approximations to continuous functions
• Optimal starting approximations for generating square root for slow or no divide
• Optimal starting values for Newton-Raphson calculation of √x ^½
• Square-Rooting Algorithms for High-Speed Digital Circuits
• Starting approximations for square root calculation on IBM system /360
• Uniform rational approximation of functions of several variables

Cited in

(9)

• Optimal value for the Newton-Raphson division algorithm
• Optimal initial approximations for the Newton-Raphson division algorithm
• Fast calculation of inverse square root with the use of magic constant -- analytical approach
• Reciprocal and reciprocal square root units with operand modification and multiplication
• Complex square root with operand prescaling
• scientific article; zbMATH DE number 3945240 (Why is no real title available?)
• Calculating the square root with arbitrary order of convergence
• Fast and accurate approximation algorithms for computing floating point square root
• Choosing starting values for certain Newton-Raphson iterations

This page was built for publication: Optimal absolute error starting values for Newton-Raphson calculation of square root

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640319)