DD-finite functions Extension of algorithms for D-finite functions
Sprache des Vortragstitels:
Invited Colloquium talk at Institut National de Recherche en Informatiqze et en Automatique (INRIA)
Sprache des Tagungstitel:
D-finite (or holonomic) functions have been studied since the last century and an algorithmic approach was successfully developed. This talk presents a wider class built as a natural extension of the D-finite class: the DD-finite functions. These functions are defined via a linear differential equation with D-finite coefficients. In this talk, we will see closure properties of this bigger class and algorithms developed to apply those properties using a computer (and the Computer Algebra System SAGE), as well as limits of the approach.