Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication
From MaRDI portal
Publication:5645027
DOI10.1109/TC.1972.5009039zbMath0235.68021MaRDI QIDQ5645027
No author found.
Publication date: 1972
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45)
Related Items (5)
A software interface and hardware design for variable-precision interval arithmetic ⋮ Reciprocal and reciprocal square root units with operand modification and multiplication ⋮ Square rooting is as difficult as multiplication ⋮ Calculating the square root with arbitrary order of convergence ⋮ Choosing starting values for certain Newton-Raphson iterations
This page was built for publication: Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication