Thumbnail
Access Restriction
Subscribed

Author Traub, J. F.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract Three iterative methods for calculation of nth roots (including one proposed by the author) are compared in two ways: (1) Theoretical convergence estimates are given. (2) A new macro-compiler which estimates machine running time is used to compare the running time of the three methods for a variety of input data.
Description Affiliation: Bell Telephone Lab, Murray Hill, NJ (Traub, J. F.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 4
Issue Number 3
Page Count 3
Starting Page 143
Ending Page 145


Open content in new tab

   Open content in new tab
Source: ACM Digital Library