Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication

DOI10.1109/TC.1972.5009039MaRDI QIDQ5645027zbMATH OpenFDO

Authors

Publication date 1972

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

Full work available at URL https://doi.org/10.1109/TC.1972.5009039

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Symbolic computation and algebraic computation (68W30)

Cited in

(5)

• Square rooting is as difficult as multiplication
• A software interface and hardware design for variable-precision interval arithmetic
• Reciprocal and reciprocal square root units with operand modification and 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

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