Best Rational Starting Approximations and Improved Newton Iteration for the Square Root

DOI10.2307/2004485zbMath0213.16402OpenAlexW4250531149MaRDI QIDQ5615005

Ichizo Ninomiya

Publication date: 1970

Full work available at URL: https://doi.org/10.2307/2004485

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (6)

Optimal absolute error starting values for Newton-Raphson calculation of square root ⋮ Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions ⋮ Improved Newton Iteration for Integral Roots ⋮ Approximating the \(p\)th root by composite rational functions ⋮ Fast computation of the Nth root ⋮ Zolotarev Iterations for the Matrix Square Root

Cites Work

• Unnamed Item
• Unnamed Item
• Quick calculation of Jacobian elliptic functions
• 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
• Generalized Rational Chebyshev Approximation

This page was built for publication: Best Rational Starting Approximations and Improved Newton Iteration for the Square Root