Computation of √x

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computation of √x

Full text

Pdf (385 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1999 ACM symposium on Applied computing table of contents

San Antonio, Texas, United States

Pages: 74 - 77

Year of Publication: 1999

ISBN:1-58113-086-4

Authors

Nabil Rousan	P.O. Box 7 Karak, JORDAN
Hani Abu-Salem	P.O. Box 7 Karak, JORDAN

Sponsors

SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 13, Citation Count: 0

Additional Information:

references 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/298151.298198 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	Andrews, M., McCormick, S. F., and Taylor, G. D. Evaluation of Functions on Microcomputers: Square Root. Int'l Journal of Computers and Mathmatics, Voi. 4, No. 4, 1978.
	2	M. Andrews , S. F. McCormick , G. D. Taylor, Evaluation of the square root function on microprocessors, Proceedings of the annual conference, p.185-191, October 20-22, 1976, Houston, Texas, United States [doi>10.1145/800191.805571]
	3	Taylor, G. D. Optimal Starting Approximations for Newton's Method. d. Approximation Theory, Vol. 3, 1970, pp. 156-163.
	4	Andrews, M. Mathematical Microprocessor Software: A ~x Comparison. IEEE Micro, Vol. 2, No. 2, May 1982, pp. 63-79.
	5	Chen, T. C. The Automatic Computation of Exponential, Logarithms, Ratios, and Square Roots. IBM Research report RJ970, 1972, p. 32.
	6	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]
	7	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]
	8	Ninomiya, I. Best Rational Starting Approximations and Improved Newton Iteration for Square Root. Math. Comp., Vol. 24, 1970, pp. 391-404.
	9	Phillips, D. L. Generalized Logarithmic Error and Newton's Method. Math. Comp., Vol. 23, 1969, pp. 383-389.
	10	Sterbenz, P. H. and Fike, C. T. Optimal Starting Approximations for Newton's Method. Math. Comp., Vol. 23, 1969, pp. 313-318.
	11	M. Wayne Wilson, Optimal starting approximations for generating square root for slow or no divide, Communications of the ACM, v.13 n.9, p.559-560, Sept. 1970 [doi>10.1145/362736.362750]
	12	Bartle, R. G. The Elements ofRealAnalysis, 2ed, John Wiley & Sons, Inc., 1964
	13	Montuschi, P. and Mezzalama, P.M., Survey of Square Root Algorithms. Computers and Digital Techniques, lEE Proceedings E., Vol. 137, No. 1, Jan. 1990, pp. 31-40.
	14	Alan H. Karp , Peter Markstein, High-precision division and square root, ACM Transactions on Mathematical Software (TOMS), v.23 n.4, p.561-589, Dec. 1997 [doi>10.1145/279232.279237]
	15	R. Hashemian, Square Rooting Algorithms for Integer and Floating-Point Numbers, IEEE Transactions on Computers, v.39 n.8, p.1025-1029, August 1990 [doi>10.1109/12.57041]
	16	Park, P. and Kailath, T., New Square-mot Smoothing Algorithms. Proceedings of 33rd Conference on Decision and Control, Lake Buena Vista, FL Dec. 1994, pp. 1215-1220.
	17	C. T. Fike, Starting approximations for square root calculation on IBM system /360, Communications of the ACM, v.9 n.4, p.297-299, April 1966 [doi>10.1145/365278.365556]
	18	Montuschi, P. and Mezzalanm, P.M., Optimal absolute error starting values for Newton-Raphson c, aleulation of Square Root. Internal Report DAI/ARC 3-86, Dipartimento di Automatica ~ Informatica, Politecnico di Torino, torino, italy, 1986.
	19	Montuschi, P. and Ciminiera, L, On the efficient implementation of higher radix square root algorithms. Proceedings 9~ Symposium on Computer Ari~ , Santa Monica, CA, Sept. 1989.
	20	J. H.P. Zurawski , J. B. Gosling, Design of a high-speed square root multiply and divide unit, IEEE Transactions on Computers, v.36 n.1, p.13-23, Jan. 1987 [doi>10.1109/TC.1987.5009445]