A parametric error analysis of Goldschmidt's division algorithm
From MaRDI portal
Recommendations
- High-precision division and square root
- Division unit with Newton-Raphson approximation and digit-by-digit refinement of the quotient
- Optimal initial approximations for the Newton-Raphson division algorithm
- Very-high radix division with prescaling and selection by rounding
- scientific article; zbMATH DE number 40800
Cites work
- A Mechanically Checked Proof of IEEE Compliance of the Floating Point Multiplication, Division and Square Root Algorithms of the AMD-K7™ Processor
- A Note on the Basic Block Diagrams of Finite Automata from the Engineering Point of View
- Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\)
- Efficient parallel circuits and algorithms for division
- scientific article; zbMATH DE number 3776824 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1485863 (Why is no real title available?)
- Log Depth Circuits for Division and Related Problems
- On Division by Functional Iteration
- On Optimal Ierative Schemes for High-Speed Division
- Optimal Size Integer Division Circuits
- The IBM System/360 Model 91: Floating-Point Execution Unit
- To Booth or not to Booth
This page was built for publication: A parametric error analysis of Goldschmidt's division algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765225)
