Reduced complexity evaluation of hypergeometric functions
The author employs fast Fourier transform-like techniques in order to reduce the complexity of the evaluation of standard approximations to hypergeometric functions and the gamma function. This leads to algorithms that provide n digits of these functions for O(\(\sqrt{n}(\log n)^ 2)\) arithmetic operations. The usual methods require O(n) operations for comparable accuracy.
scientific article; zbMATH DE number 3992105