New methods for approximating square roots
From MaRDI portal
Publication:2369181
DOI10.1016/j.amc.2005.07.056zbMath1088.65020OpenAlexW2066436062MaRDI QIDQ2369181
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.07.056
Computation of special functions and constants, construction of tables (65D20) Elementary functions (26A09)
Related Items (4)
Inverse function, Taylor's expansion and extended Schröder's processes ⋮ A low-complexity LUT-based squaring algorithm ⋮ Methods with prefixed order for approximating square roots with global and general convergence ⋮ Newton's method and high-order algorithms for the \(n\)th root computation
Cites Work
- Unnamed Item
- \(n\)th root extraction: Double iteration process and Newton's method
- Accelerated convergence in Newton's method for approximating square roots
- Calculus of \(n\)th roots and third order iterative methods.
- High order iterative methods for approximating square roots
- Algorithms for \(n\)-th root approximation.
- A Modified Babylonian Algorithm
This page was built for publication: New methods for approximating square roots