Calculating the square root with arbitrary order of convergence
From MaRDI portal
Recommendations
- Short Notes: Rapidly Converging Iterative Formulae for Finding Square Roots and their Computational Efficiencies
- Optimal absolute error starting values for Newton-Raphson calculation of square root
- High order algorithms for calculating roots
- On two sequences of algorithms for approximating square roots
- New methods for approximating square roots
Cites work
- An acceleration technique for the Newton solution of quadratic equations
- scientific article; zbMATH DE number 3684883 (Why is no real title available?)
- scientific article; zbMATH DE number 3326105 (Why is no real title available?)
- Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication
Cited in
(10)- An algorithm for inverse square-roots
- Ordering of nested square roots of 2 according to the Gray code
- Optimal absolute error starting values for Newton-Raphson calculation of square root
- On a class of recursive relations for calculating square roots of numbers
- Forcing smooth square roots and integration
- Short Notes: Rapidly Converging Iterative Formulae for Finding Square Roots and their Computational Efficiencies
- Square rooting by iterative multiply-additions
- An integer based square root algorithm
- Fast and accurate approximation algorithms for computing floating point square root
- Dynamic properties of an exact algorithm for square root calculation
This page was built for publication: Calculating the square root with arbitrary order of convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518240)
