On Division by Functional Iteration

DOI10.1109/T-C.1970.223019MaRDI QIDQ5597999zbMATH OpenOpenAlexFDO

Authors 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

Cites work

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

Cited in

(13)

• Optimal value for the Newton-Raphson division algorithm
• Optimal initial approximations 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
• Reducing division latency with reciprocal caches
• Reciprocal and reciprocal square root units with operand modification and multiplication
• Real-time arithmetic unit
• Speedup of linear stationary iteration processes in multiprocessor computers. I
• PROCESSES AND THEIR INTERACTIONS
• On Division by Functional Iteration
• Optimal approximation of the 1/x function using Chebyshev polynomials and magic constants
• Kernel float: unlocking mixed-precision GPU programming
• An implementation of quantum oracles for the finite element method

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5597999)