Reduced complexity evaluation of hypergeometric functions (Q1819306)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reduced complexity evaluation of hypergeometric functions |
scientific article; zbMATH DE number 3992105
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reduced complexity evaluation of hypergeometric functions |
scientific article; zbMATH DE number 3992105 |
Statements
Reduced complexity evaluation of hypergeometric functions (English)
0 references
1987
0 references
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.
0 references
fast Fourier transform-like techniques
0 references
hypergeometric functions
0 references
gamma function
0 references
algorithms
0 references
