On Division by Functional Iteration

DOI10.1109/T-C.1970.223019zbMath0199.51705OpenAlexW2118495140MaRDI QIDQ5597999

Michael J. Flynn

Publication date: 1970

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1970.223019

zbMATH Keywords

computer science and automata

Related Items (10)

Optimal initial approximations for the Newton-Raphson division algorithm ⋮ A software interface and hardware design for variable-precision interval arithmetic ⋮ On Division by Functional Iteration ⋮ Reducing division latency with reciprocal caches ⋮ Reciprocal and reciprocal square root units with operand modification and multiplication ⋮ Optimal value for the Newton-Raphson division algorithm ⋮ PROCESSES AND THEIR INTERACTIONS ⋮ A parametric error analysis of Goldschmidt's division algorithm ⋮ Speedup of linear stationary iteration processes in multiprocessor computers. I ⋮ Real-time arithmetic unit

Cites Work

• Variable Latency Goldschmidt Algorithm Based on a New Rounding Method and a Remainder Estimate
• A Rounding Method to Reduce the Required Multiplier Precision for Goldschmidt Division
• On Division by Functional Iteration

This page was built for publication: On Division by Functional Iteration