Pages that link to "Item:Q3994201"
From MaRDI portal
The following pages link to A fast \(O(n^ 2)\) division algorithm for multiple-precision floating- point numbers (Q3994201):
Displaying 7 items.
- Optimal value for the Newton-Raphson division algorithm (Q1198046) (← links)
- A parametric error analysis of Goldschmidt's division algorithm (Q1765225) (← links)
- Zur Division mit Rest auf Gleitkommarechnern. (Division with remainder on floating point computers) (Q1823970) (← links)
- An algorithm for multiple-precision floating-point multiplication (Q2485630) (← links)
- Division unit with Newton-Raphson approximation and digit-by-digit refinement of the quotient (Q4323589) (← links)
- SRT Division Algorithms as Dynamical Systems (Q5317196) (← links)
- Finding normal binary floating-point factors efficiently (Q6156639) (← links)