Choosing starting values for certain Newton-Raphson iterations

DOI10.1016/j.tcs.2005.09.056zbMath1086.65047OpenAlexW2018090357MaRDI QIDQ817866

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

zbMATH Keywords

Newton-Raphson iterationdivisioncomputer arithmeticroot extractionsquare-rootsquare-root reciprocal

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Mathematical problems of computer architecture (68M07)

Related Items (1)

The polynomial pivots as initial values for a new root-finding iterative method

Cites Work

• Unnamed Item
• Square root approximations in Old Babylonian mathematics: YBC 7289 in context
• Optimal initial approximations for the Newton-Raphson division algorithm
• Optimal absolute error starting values for Newton-Raphson calculation of square root
• A Mechanically Checked Proof of IEEE Compliance of the Floating Point Multiplication, Division and Square Root Algorithms of the AMD-K7^™ Processor
• Measuring the accuracy of ROM reciprocal tables
• 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 ^½
• Optimal starting approximations for generating square root for slow or no divide
• Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication

This page was built for publication: Choosing starting values for certain Newton-Raphson iterations