NumGfun: a Package for Numerical and Analytic Computation with D-finite Functions

2010/02/16 by Marc Mezzarobba, Mezzarobba, Marc · 1 citation
Computer Science · Mathematics · #FOS: Computer and information sciences #Matrix Theory and Algorithms #Numerical Methods and Algorithms #Numerical methods for differential equations #Polynomial and algebraic computation #Symbolic Computation (cs.SC)

paper · pdf · doi:10.48550/arxiv.1002.3077

openalex publication_date 2010/02/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This article describes the implementation in the software package NumGfun of classical algorithms that operate on solutions of linear differential equations or recurrence relations with polynomial coefficients, including what seems to be the first general implementation of the fast high-precision numerical evaluation algorithms of Chudnovsky & Chudnovsky. In some cases, our descriptions contain improvements over existing algorithms. We also provide references to relevant ideas not currently used in NumGfun.

Cited by

• Periods of fibre products of elliptic surfaces and the Gamma conjecture

Related

• GFUN
• Rigorous uniform approximation of D-finite functions using Chebyshev expansions
• Software for the Algorithmic Work with Orthogonal Polynomials and Special Functions
• Numerical Algorithmic Science and Engineering within Computer Science: Rationale, Foundations and Organization
• Numerical Evaluation of Elliptic Functions, Elliptic Integrals and Modular Forms