Author(s)

Jan Šustek

Department of Mathematics, Faculty of Science, University of Ostrava, Ostrava, Czech Republic.

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.

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

Šustek, J. (2014) Compound Means and Fast Computation of Radicals. Applied Mathematics, 5, 2493-2517. doi: 10.4236/am.2014.516241.