Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Best rational starting approximations and improved Newton iteration for the square root
HTML articles powered by AMS MathViewer

by Ichizo Ninomiya PDF
Math. Comp. 24 (1970), 391-404 Request permission

Abstract:

The most important class of the best rational approximations to the square root is obtained analytically by means of elliptic function theory. An improvement of the Newton iteration procedure is proposed.
References
  • N. I. Achieser, Theory of approximation, Frederick Ungar Publishing Co., New York, 1956. Translated by Charles J. Hyman. MR 0095369
  • P. L. Chebyshev, "Sur les expressions approchées de la racine carrée d’une variable par des fractions simples," Oeuvres, Vol. 2, Chelsea, New York, pp. 542–558. P. L. Chebyshev, "Sur les fractions algébriques qui représentent approximativement la racine carrée d’une variable comprise entre les limites données," Oeuvres, Vol. 2, Chelsea, New York, p. 725. W. J. Cody, "Double-precision square root for the CDC-3600," Comm. ACM, v. 7, 1964, pp. 715– 718. J. Eve, "Starting approximations for the iterative calculation of square roots," Comput. J., v. 6, 1963, pp. 274–276. C. T. Fike, "Starting approximations for square root calculation on IBM system/360," Comm. ACM, v. 9, 1966, pp. 297–299.
  • David G. Moursund, Optimal starting values for Newton-Raphson calculation of $\surd x$, Comm. ACM 10 (1967), 430–432. MR 0240952, DOI 10.1145/363427.363454
  • Richard F. King and David L. Phillips, The logarithmic error and Newton’s method for the square root, Comm. ACM 12 (1969), 87–88. MR 0285109, DOI 10.1145/362848.362861
  • P. H. Sterbenz & C. T. Fike, "Optimal starting approximations for Newton’s method," Math. Comp., v. 23, 1969, pp. 313–318.
  • Ichizo Ninomiya, Generalized rational Chebyshev approximation, Math. Comp. 24 (1970), 159–169. MR 261229, DOI 10.1090/S0025-5718-1970-0261229-8
  • H. E. Salzer, "Quick calculation of Jacobian elliptic functions," Comm. ACM, v. 5, 1962, p. 399.
  • Milton Abramowitz and Irene A. Stegun, Handbook of mathematical functions with formulas, graphs, and mathematical tables, National Bureau of Standards Applied Mathematics Series, No. 55, U. S. Government Printing Office, Washington, D.C., 1964. For sale by the Superintendent of Documents. MR 0167642
  • J. Tannery & J. Molk, Éléments de la Théorie des Fonctions Elliptiques, Vol. 1, Gauthier-Villars. Paris, 1893, pp. 294–295.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65.50
  • Retrieve articles in all journals with MSC: 65.50
Additional Information
  • © Copyright 1970 American Mathematical Society
  • Journal: Math. Comp. 24 (1970), 391-404
  • MSC: Primary 65.50
  • DOI: https://doi.org/10.1090/S0025-5718-1970-0273809-4
  • MathSciNet review: 0273809