Best Rational Starting Approximations and Improved Newton Iteration for the Square Root
From MaRDI portal
Publication:5615005
DOI10.2307/2004485zbMATH Open0213.16402OpenAlexW4250531149MaRDI QIDQ5615005FDOQ5615005
Authors: Ichizo Ninomiya 
Publication date: 1970
Full work available at URL: https://doi.org/10.2307/2004485
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Starting Approximations for the Iterative Calculation of Square Roots
- Double-precision square root for the CDC-3600
- Starting approximations for square root calculation on IBM system /360
- Optimal starting values for Newton-Raphson calculation of √x ½
- The logarithmic error and Newton's method for the square root
- Quick calculation of Jacobian elliptic functions
- Generalized Rational Chebyshev Approximation
Cited In (6)
- Improved Newton Iteration for Integral Roots
- Fast computation of the Nth root
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Optimal absolute error starting values for Newton-Raphson calculation of square root
- Zolotarev iterations for the Matrix square Root
- Approximating the \(p\)th root by composite rational functions
This page was built for publication: Best Rational Starting Approximations and Improved Newton Iteration for the Square Root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5615005)
