Optimal starting values for Newton-Raphson calculation of x 1 2
暂无分享,去创建一个
The problem of obtaining starting values for the Newton-Raphson calculation of √ x on a digital computer is considered. It is shown that the conventionally used best uniform approximations to √ x do not provide optimal starting values. The problem of obtaining optimal starting values is stated, and several basic results are proved. A table of optimal polynomial starting values is given.
[1] D. Moursund. Chebyshev Approximation Using a Generalized Weight Function , 1966 .
[2] J. Eve. Starting Approximations for the Iterative Calculation of Square Roots , 1963, Comput. J..
[3] D. Moursund. Computational Aspects of Chebyshev Approximation Using a Generalized Weight Function , 1968 .
[4] C. T. Fike. Starting approximations for square root calculation on IBM system /360 , 1966, CACM.