Optimal value for the Newton-Raphson division algorithm

DOI10.1016/0020-0190(92)90137-KMaRDI QIDQ1198046zbMATH OpenOpenAlexFDO

Authors A. Parker, J. O. Hamblen

Publication date 16 January 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(92)90137-k

zbMATH Keywords

analysis of algorithmsfast division of floating point numbersiterative algorithmNewton-Raphson algorithm

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Optimal initial approximations for the Newton-Raphson division algorithm
• A division algorithm without number comparison
• Optimal absolute error starting values for Newton-Raphson calculation of square root
• Division unit with Newton-Raphson approximation and digit-by-digit refinement of the quotient
• scientific article; zbMATH DE number 40800

Cites work

• On Division by Functional Iteration

Cited in

(5)

• Optimal initial approximations for the Newton-Raphson division algorithm
• Optimal absolute error starting values for Newton-Raphson calculation of square root
• Constant-division algorithms
• An implementation of quantum oracles for the finite element method
• Choosing starting values for certain Newton-Raphson iterations

This page was built for publication: Optimal value 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 Q1198046)