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 n...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.展开更多
基金supported by grant P201/12/2351 of the Czech Science Foundationby grant 01798/2011/RRC of the Moravian-Silesian regionby grant SGS08/PrF/2014 of the University of Ostrava.
文摘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.
