Skip to main navigation Skip to search Skip to main content

NumGfun: A package for numerical and analytic computation with D-finite functions

  • INRIA Rocquencourt

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

31 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010
Pages139-146
Number of pages8
Publication statusPublished - 9 Sept 2010
Externally publishedYes
Event2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010 - Munich, Germany
Duration: 25 Jul 201028 Jul 2010

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Conference

Conference2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010
Country/TerritoryGermany
CityMunich
Period25/07/1028/07/10

Keywords

  • Bounds
  • Certified numerical computation
  • D-finite functions
  • Linear differential equations
  • Maple

Fingerprint

Dive into the research topics of 'NumGfun: A package for numerical and analytic computation with D-finite functions'. Together they form a unique fingerprint.

Cite this