Square rooting by iterative multiply-additions
From MaRDI portal
Publication:673237
DOI10.1016/S0020-0190(96)00167-6zbMATH Open0900.68233OpenAlexW2040794578MaRDI QIDQ673237FDOQ673237
Authors: Masayuki Ito, Naofumi Takagi, S. Yajima
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00167-6
Recommendations
- An Iterative Method for Approximating Square Roots
- Iterative square roots of functions
- The Iterated Total Squaring Operation
- scientific article; zbMATH DE number 6863884
- Root squaring using level-index arithmetic
- Higher radix square rooting
- Iterative methods for computing the matrix square root
- Calculating the square root with arbitrary order of convergence
Cited In (7)
- Reciprocal and reciprocal square root units with operand modification and multiplication
- An integer based square root algorithm
- Title not available (Why is that?)
- The Iterated Total Squaring Operation
- Square-Rooting Algorithms for High-Speed Digital Circuits
- A BJT technology-based current-mode square rooting circuits
- A certifying square root and division elimination
This page was built for publication: Square rooting by iterative multiply-additions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673237)