Fürer, M. (2007) Faster Integer Multiplication. Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, 11-13 June 2007, 55-67.

has been cited by the following article:

• TITLE: Compound Means and Fast Computation of Radicals

  AUTHORS: Jan Šustek

  KEYWORDS: Compound Means, Padé Approximation, Computation of Radicals, Iteration

  JOURNAL NAME: Applied Mathematics, Vol.5 No.16, September 2, 2014

  ABSTRACT: In last decades, several algorithms were developed for fast evaluation of some elementary functions with very large arguments, for example for multiplication of million-digit integers. The present paper introduces a new fast iterative method for computing values with high accuracy, for fixed and . The method is based on compound means and Padé approximations.