JOHANSSON, Fredrik

doi:10.1145/3328732

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

JOHANSSON, Fredrik
Lithe and fast algorithmic number theory [LFANT]

Idioma

Article de revue

Este ítem está publicado en

ACM Transactions on Mathematical Software. 2019-08-08, vol. 45, n° 3, p. 1-26

Association for Computing Machinery

Resumen en inglés

We present an efficient implementation of hypergeometric functions in arbitrary-precision interval arithmetic. The functions 0F1, 1F1, 2F1 and 2F0 (or the Kummer U-function) are supported for unrestricted complex parameters and argument, and by extension, we cover exponential and trigonometric integrals, error functions, Fresnel integrals, incomplete gamma and beta functions, Bessel functions, Airy functions, Legendre functions, Jacobi polynomials, complete elliptic integrals, and other special functions. The output can be used directly for interval computations or to generate provably correct floating-point approximations in any format. Performance is competitive with earlier arbitrary-precision software, and sometimes orders of magnitude faster. We also partially cover the generalized hypergeometric function pFq and computation of high-order parameter derivatives.< Leer menos

Palabras clave en inglés

orthogonal polynomials

Bessel functions

arbitrary-precision arithmetic

hypergeometric functions

interval arithmetic

automatic differentiation

URI

https://oskar-bordeaux.fr/handle/20.500.12278/194056

DOI

http://dx.doi.org/10.1145/3328732

Proyecto europeo

Algorithmic Number Theory in Computer Science

Orígen

Importado de Hal

Centros de investigación

Institut de Mathématiques de Bordeaux (IMB) - UMR 5251