Reduced complexity evaluation of hypergeometric functions
From MaRDI portal
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.
Recommendations
Cites work
- Fast Multiple-Precision Evaluation of Elementary Functions
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- On the Complexity of Familiar Functions and Numbers
- On the Davidenko-Branin Method for Solving Simultaneous Nonlinear Equations
- The Arithmetic-Geometric Mean and Fast Computation of Elementary Functions
Cited in
(11)- A fast algorithm for evaluation of normalized Hermite functions
- Validated computation of certain hypergeometric functions
- Evaluating parametric holonomic sequences using rectangular splitting
- Calculation of the values of hypergeometric functions
- On a new method for fast evaluation of transcendental functions
- scientific article; zbMATH DE number 1361301 (Why is no real title available?)
- scientific article; zbMATH DE number 219930 (Why is no real title available?)
- Вычисление гипергеометрических рядов с квазилинейной временной и линейной eмкостной сложностью
- Computing hypergeometric functions rigorously
- Reduced Cancellation in the Evaluation of Entire Functions and Applications to the Error Function
- Fast and stable rational approximation of generalized hypergeometric functions
This page was built for publication: Reduced complexity evaluation of hypergeometric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1819306)