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

From MaRDI portal

Revision as of 05:13, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5645027

Jump to:navigation, search

DOI10.1109/TC.1972.5009039zbMath0235.68021MaRDI QIDQ5645027

No author found.

Publication date: 1972

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

Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5645027&oldid=30324097"