Computing representations for radicals of finitely generated differential ideals

François Boulier (1, 2) , Daniel Lazard (3) , François Ollivier (4) , Michel Petitot (1, 2)

1 LIFL - Laboratoire d'Informatique Fondamentale de Lille
2 CALFOR - Calcul Formel
3 CALFOR - Calcul formel
4 GAGE - Groupe Aleph et Géode

This paper deals with systems of polynomial differential equations, ordinary or with partial derivatives. The embedding theory is the differential algebra of Ritt and Kolchin. We describe an algorithm, named Rosenfeld-Gröbner, which computes a representation for the radical P of the differential ideal generated by any such system S. The computed representation constitutes a normal simplifier for the equivalence relation modulo P (it permits to test membership in P). It permits also to compute Taylor expansions of solutions of S. The algorithm is implemented within a package in MAPLE V.

Mots clés: MAPLE; differential algebra; elimination; Rosenfeld-Gröbner; diffalg

Domaines: Equations aux dérivées partielles [math.AP]; Algèbre commutative [math.AC]; Calcul formel [cs.SC]

François Boulier, Daniel Lazard, François Ollivier, Michel Petitot. Computing representations for radicals of finitely generated differential ideals. 1999. ⟨hal-00139061⟩