Computing with D-algebraic power series

Joris van der Hoeven (1)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

In this paper, we will present several algorithms for computing with D-algebraic power series. Such power series are specified by one or more algebraic differential equations and a sufficient number of initial conditions. The emphasis is not on the efficient computation of coefficients of such power series (various techniques are known for that), but rather on the ability to decide whether expressions involving D-algebraic power series are zero. We will both consider univariate and multivariate series and, besides the usual ring operations and differentiation, we will also consider composition, implicitly determined power series and monomial transformations.

Mots clés: D-algebraic power series; algorithm; zero-test; implicit function; zero test; implicit function A.M.S. subject classification: 68W30; 34A09; 34A12

Domaines: Logiciel mathématique [cs.MS]

Joris van der Hoeven. Computing with D-algebraic power series. Applicable Algebra in Engineering, Communication and Computing, 2019, 30 (1), pp.17-49. ⟨10.1007/s00200-018-0358-y⟩. ⟨hal-00979367v2⟩