A parametric error analysis of Goldschmidt's division algorithm

DOI10.1016/j.jcss.2004.08.004zbMath1076.68114OpenAlexW2034962580MaRDI QIDQ1765225

Guy Even, Peter-Michael Seidel, Warren E. jun. Ferguson

Publication date: 23 February 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.08.004

zbMATH Keywords

Floating point arithmeticGoldschmidt's division algorithmParametric error analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Mathematical problems of computer architecture (68M07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\)
• Efficient parallel circuits and algorithms for division
• Optimal Size Integer Division Circuits
• Log Depth Circuits for Division and Related Problems
• A Mechanically Checked Proof of IEEE Compliance of the Floating Point Multiplication, Division and Square Root Algorithms of the AMD-K7^™ Processor
• To Booth or not to Booth
• The IBM System/360 Model 91: Floating-Point Execution Unit
• A Note on the Basic Block Diagrams of Finite Automata from the Engineering Point of View
• On Optimal Ierative Schemes for High-Speed Division
• On Division by Functional Iteration

This page was built for publication: A parametric error analysis of Goldschmidt's division algorithm