ACM

Communications of the ACM

Home/Magazine Archive/March 1961 (Vol. 4, No. 3)/Comparison of iterative methods for the calculation.../Abstract

Comparison of iterative methods for the calculation of nth roots

By J. F. Traub
Communications of the ACM, March 1961, Vol. 4 No. 3, Pages 143-145
10.1145/366199.366252
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.