Optimal initial approximations for the Newton-Raphson division algorithm
From MaRDI portal
The authors present an iterative algorithm for determining the initial values \(c_ 0\) and \(c_ 1\) which minimize the maximum absolute error of the final result in processed data with the Newton-Raphson division algorithm. Some numerical examples and absolute error curves are given.
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
(8)- Optimal value for the Newton-Raphson division algorithm
- A parametric error analysis of Goldschmidt's division algorithm
- A software interface and hardware design for variable-precision interval arithmetic
- On the choice of initial guesses for the Newton-Raphson algorithm
- Optimal absolute error starting values for Newton-Raphson calculation of square root
- Mathematical model of stored logic based computation
- Optimal approximation of the 1/x function using Chebyshev polynomials and magic constants
- 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)
