Optimal initial approximations for the Newton-Raphson division algorithm

DOI10.1007/BF02307376MaRDI QIDQ1340865zbMATH OpenFDO

Authors J. Omar, Michael J. Schulte, Earl E. jun. Swartzlander

Publication date 20 December 1994

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

iterative algorithmnumerical examplesinitial approximationNewton-Raphson division algorithm

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Recommendations

• Optimal value for the Newton-Raphson division algorithm
• Optimal absolute error starting values for Newton-Raphson calculation of square root
• scientific article; zbMATH DE number 3945240
• Division unit with Newton-Raphson approximation and digit-by-digit refinement of the quotient
• High-precision division and square root

Cites work

• A Note on the Basic Block Diagrams of Finite Automata from the Engineering Point of View
• Minimum relative error approximations for 1/t
• On Division by Functional Iteration
• Optimal absolute error starting values for Newton-Raphson calculation of square root
• Optimal starting values for Newton-Raphson calculation of √x ^½
• Optimal value for the Newton-Raphson division algorithm
• The IBM System/360 Model 91: Floating-Point Execution Unit

Cited in

(7)

• On the choice of initial guesses for the Newton-Raphson algorithm
• Optimal absolute error starting values for Newton-Raphson calculation of square root
• A parametric error analysis of Goldschmidt's division algorithm
• A software interface and hardware design for variable-precision interval arithmetic
• Mathematical model of stored logic based computation
• Optimal value for the Newton-Raphson division algorithm
• Choosing starting values for certain Newton-Raphson iterations

This page was built for publication: Optimal initial approximations for the Newton-Raphson division algorithm

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