Optimal starting values for Newton-Raphson calculation of √x ½

DOI10.1145/363427.363454MaRDI QIDQ5536995zbMATH OpenOpenAlexFDO

Authors D. G. Motursund

Publication date 1967

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/363427.363454

zbMATH Keywords

numerical analysis

Cited in

(17)

• Optimal rational starting approximations
• Characterization of minimal elements in minimization problems with constraints
• Optimal initial approximations for the Newton-Raphson division algorithm
• Approximation in normed linear spaces
• Optimal starting approximations for iterative schemes
• On the existence of best rational approximation using a generalized weight function
• Continuity of the best approximation operator for restricted range approximations
• Uniform rational weighted approximations having restricted ranges
• Uniform approximation of vector-valued functions
• Optimal starting approximations for Newton's method
• Kolmogoroff's criterion for constrained rational approximation
• Optimal absolute error starting values for Newton-Raphson calculation of square root
• Generalized Rational Chebyshev Approximation
• Best Rational Starting Approximations and Improved Newton Iteration for the Square Root
• Improved Newton Iteration for Integral Roots
• Fast and accurate approximation algorithms for computing floating point square root
• Choosing starting values for certain Newton-Raphson iterations

This page was built for publication: Optimal starting values for Newton-Raphson calculation of √x ^½

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5536995)