Choosing starting values for certain Newton-Raphson iterations
From MaRDI portal
Publication:817866
DOI10.1016/J.TCS.2005.09.056zbMATH Open1086.65047OpenAlexW2018090357MaRDI QIDQ817866FDOQ817866
Authors: Peter Kornerup, Jean-Michel Muller
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.056
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
- \(n\)th root extraction: Double iteration process and Newton's method
Cites Work
- A Mechanically Checked Proof of IEEE Compliance of the Floating Point Multiplication, Division and Square Root Algorithms of the AMD-K7™ Processor
- Square root approximations in Old Babylonian mathematics: YBC 7289 in context
- Optimal initial approximations for the Newton-Raphson division algorithm
- Measuring the accuracy of ROM reciprocal tables
- Optimal starting approximations for generating square root for slow or no divide
- Optimal absolute error starting values for Newton-Raphson calculation of square root
- Starting Approximations for the Iterative Calculation of Square Roots
- Double-precision square root for the CDC-3600
- Starting approximations for square root calculation on IBM system /360
- Optimal starting values for Newton-Raphson calculation of √x ½
- Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication
- Title not available (Why is that?)
Cited In (4)
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)