Choosing starting values for certain Newton-Raphson iterations
From MaRDI portal
Recommendations
- Optimal absolute error starting values for Newton-Raphson calculation of square root
- Optimal value for the Newton-Raphson division algorithm
- Optimal initial approximations for the Newton-Raphson division algorithm
- scientific article; zbMATH DE number 5787345
- nth root extraction: Double iteration process and Newton's method
Cites work
- scientific article; zbMATH DE number 3182521 (Why is no real title available?)
- A Mechanically Checked Proof of IEEE Compliance of the Floating Point Multiplication, Division and Square Root Algorithms of the AMD-K7™ Processor
- Double-precision square root for the CDC-3600
- Measuring the accuracy of ROM reciprocal tables
- Optimal absolute error starting values for Newton-Raphson calculation of square root
- Optimal initial approximations for the Newton-Raphson division algorithm
- Optimal starting approximations for generating square root for slow or no divide
- Optimal starting values for Newton-Raphson calculation of √x ½
- Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication
- Square root approximations in Old Babylonian mathematics: YBC 7289 in context
- Starting Approximations for the Iterative Calculation of Square Roots
- Starting approximations for square root calculation on IBM system /360
Cited in
(4)- On the choice of initial guesses for the Newton-Raphson algorithm
- scientific article; zbMATH DE number 1995854 (Why is no real title available?)
- The polynomial pivots as initial values for a new root-finding iterative method
- scientific article; zbMATH DE number 5696744 (Why is no real title available?)
This page was built for publication: Choosing starting values for certain Newton-Raphson iterations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817866)