Nabil Rousan
- 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.Google Scholar
- 2.Andrews, M., McCormick, S. F., and Taylor, G. D. Evaluation of the Square Root Function on Microprocessors. Proceedings of A CM Annual Conference., Houston, Oct. 1976, pp. 185-190. Google ScholarDigital Library
- 3.Taylor, G. D. Optimal Starting Approximations for Newton's Method. d. Approximation Theory, Vol. 3, 1970, pp. 156-163.Google ScholarCross Ref
- 4.Andrews, M. Mathematical Microprocessor Software: A ~x Comparison. IEEE Micro, Vol. 2, No. 2, May 1982, pp. 63-79.Google ScholarDigital Library
- 5.Chen, T. C. The Automatic Computation of Exponential, Logarithms, Ratios, and Square Roots. IBM Research report RJ970, 1972, p. 32.Google Scholar
- 6.Moursund, D. G. Optimal String Values for Newton Raphson Calculation of ~"x. Communication of ACM, Vol. 10, No. 7, July 1967, pp. 430-432. Google ScholarDigital Library
- 7.King, R.F. and Phillips, D. L. The Logarithmic Error and Newton's Method for the Square Root Communication of A CM, Vol. 12, 1969, pp.87-88. Google ScholarDigital Library
- 8.Ninomiya, I. Best Rational Starting Approximations and Improved Newton Iteration for Square Root. Math. Comp., Vol. 24, 1970, pp. 391-404.Google ScholarCross Ref
- 9.Phillips, D. L. Generalized Logarithmic Error and Newton's Method. Math. Comp., Vol. 23, 1969, pp. 383-389.Google Scholar
- 10.Sterbenz, P. H. and Fike, C. T. Optimal Starting Approximations for Newton's Method. Math. Comp., Vol. 23, 1969, pp. 313-318.Google ScholarCross Ref
- 11.Wilson, M. W. Optimal Starting Approximations for Generating Square Root for Slow or No Divide. Communication of ACM, Vol. 13, 1970. Google ScholarDigital Library
- 12.Bartle, R. G. The Elements ofRealAnalysis, 2ed, John Wiley & Sons, Inc., 1964Google Scholar
- 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.Google Scholar
- 14.Karp, A. H. and Markstein, P., High-precision division and square root. A CM Transactions on Mathematical Software, Vol. 23, No. 4, Dec. 1997, pp. 561-589. Google ScholarDigital Library
- 15.Hashemian, R. Square Rooting Algorithms for integer and Floating-Point Numbers. IEEE Transactions on Computers , Vol. 39, No. 8, Aug. 1990, pp. 1025- 1029. Google ScholarDigital Library
- 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.Google Scholar
- 17.Fike, C. T., Starting approximations for square root calculation on IBM system 360. Communications of ACM, V ol. 9, No. 4, 1966, pp. 297-299. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google ScholarCross Ref
- 20.Zurawski, J.H.P. and Gosling, J.B. Design of a highspeed square root multiply and divide unit. IEEE Transactions on Computers, Vol. C-36, No. 1, 1987, pp. 13-23. Google ScholarDigital Library
Index Terms
- Computation of √x
Recommendations
Some results on pseudo MV-algebras with square roots
AbstractThe paper provides a study of pseudo MV-algebras with square roots. We introduce different notions of a square root on a pseudo MV-algebra, and present their main properties. We show that the class of pseudo-MV-algebras with square roots is a ...
High-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root
A new method for the high-speed computation of double-precision floating-point reciprocal, division, square root, and inverse square root operations is presented in this paper. This method employs a second-degree minimax polynomial approximation to ...
Secure distributed computation of the square root and applications
ISPEC'12: Proceedings of the 8th international conference on Information Security Practice and ExperienceThe square root is an important mathematical primitive whose secure, efficient, distributed computation has so far not been possible. We present a solution to this problem based on Goldschmidt's algorithm. The starting point is computed by linear ...
Comments