Comparison of iterative methods for the calculation of nth roots

  • Authors:

  • J. F. Traub

  • Affiliations:

  • Bell Telephone Lab, Murray Hill, NJ

  • Venue:
  • Communications of the ACM
  • Year:
  • 1961

Quantified Score

Hi-index 48.23

Visualization

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.