Reduced complexity evaluation of hypergeometric functions
type: Item
instance of: scholarly article
title: Reduced complexity evaluation of hypergeometric functions
zbMATH Open document ID: 0613.42007
DOI: 10.1016/0021-9045(87)90017-7
published in: Journal of Approximation Theory
publication date: 1987-01-01T00:00:00Z
review text: 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.
reviewed by: Rekha Srivastava
Mathematics Subject Classification ID: 42A38
Mathematics Subject Classification ID: 33C05
zbMATH DE Number: 3992105
zbMATH Keywords: fast Fourier transform-like techniques
zbMATH Keywords: hypergeometric functions
zbMATH Keywords: gamma function
zbMATH Keywords: algorithms
author: Peter Borwein
MaRDI profile type: Publication
full work available at URL: 0021-9045(87)90017-7
OpenAlex ID: W2029392114
cites work: Q4091421
cites work: Q4190138
cites work: The Arithmetic-Geometric Mean and Fast Computation of Elementary Functions
cites work: On the Complexity of Familiar Functions and Numbers
cites work: On the Davidenko-Branin Method for Solving Simultaneous Nonlinear Equations
cites work: Fast Multiple-Precision Evaluation of Elementary Functions
cites work: Q4349924
description: scientific article; zbMATH DE number 3992105