New methods for approximating square roots
From MaRDI portal
Recommendations
- Methods with prefixed order for approximating square roots with global and general convergence
- Accelerated convergence in Newton's method for approximating square roots
- On two sequences of algorithms for approximating square roots
- High order iterative methods for approximating square roots
- Iterative methods for computing the matrix square root
Cites work
- scientific article; zbMATH DE number 45971 (Why is no real title available?)
- A Modified Babylonian Algorithm
- Accelerated convergence in Newton's method for approximating square roots
- Algorithms for \(n\)-th root approximation.
- Calculus of \(n\)th roots and third order iterative methods.
- High order iterative methods for approximating square roots
- nth root extraction: Double iteration process and Newton's method
Cited in
(9)- Accelerated convergence in Newton's method for approximating square roots
- An Iterative Method for Approximating Square Roots
- A low-complexity LUT-based squaring algorithm
- A tight bound for approximating the square root
- Methods with prefixed order for approximating square roots with global and general convergence
- On two sequences of algorithms for approximating square roots
- Calculating the square root with arbitrary order of convergence
- Inverse function, Taylor's expansion and extended Schröder's processes
- Newton's method and high-order algorithms for the \(n\)th root computation
This page was built for publication: New methods for approximating square roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369181)