Optimal starting approximations for generating square root for slow or no divide

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimal starting approximations for generating square root for slow or no divide

Full text

Pdf (301 KB)

Source

Communications of the ACM archive
Volume 13 , Issue 9 (September 1970) table of contents

Pages: 559 - 560

Year of Publication: 1970

ISSN:0001-0782

Author

M. Wayne Wilson

IBM Scientific Center, Houston, TX

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 17, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/362736.362750 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	FIKE, C. T. Computer Evaluation of Mathematical Funstion Prentice-Hall, Englewood Cliffs, N. J., 1968.
	2	JAMES, WENDY, AND JARRATT, P. The generation of sqme roots on a computer with rapid multiplication compared wiih division. Math. Comput. 19 (1965), 497-500.
	3	Richard F. King , David L. Phillips, The logarithmic error and Newton's method for the square root, Communications of the ACM, v.12 n.2, p.87-88, Feb. 1969 [doi>10.1145/362848.362861]
	4	MOURSUND, D. G. Chebyshev approximation using a general ized weight function. SIAM J. Num. Anal. 3 (1966), 435-420
	5	David G. Moursund, Optimal starting values for Newton-Raphson calculation of x^{1 2} , Communications of the ACM, v.10 n.7, p.430-432, July 1967 [doi>10.1145/363427.363454]
	6	MOURSUND, D. G. Computational aspects of Chebyshev approximation using a generalized weight function SIAM J., Num. Anal. 5 (1968), 126-137.
	7	STERBENZ, P. H., AND FIKE, C. W. Optimal starting approximations for Newton's method. Math. Comput. 2.3 (1959: 313-318.

CITED BY 2

	Nabil Rousan , Hani Abu-Salem, Computation of √x, Proceedings of the 1999 ACM symposium on Applied computing, p.74-77, February 28-March 02, 1999, San Antonio, Texas, United States
	Peter Kornerup , Jean-Michel Muller, Choosing starting values for certain Newton-Raphson iterations, Theoretical Computer Science, v.351 n.1, p.101-110, 14 February 2006

INDEX TERMS

Keywords:
Newton-Raphson iteration, optimal approximations, square root

Collaborative Colleagues:

M. Wayne Wilson: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player