Computing representations for radicals of finitely generated differential ideals

Abstract

International audienceThis paper deals with systems of polynomial di erential equations, ordinary or with partial derivatives. The embedding theory is the di erential algebra of Ritt and Kolchin. We describe an algorithm, named Rosenfeld-Gröbner, which computes a representation for the radical p of the diff erential ideal generated by any such sys- tem . The computed representation constitutes a normal simpli er for the equivalence relation modulo p (it permits to test embership in p). It permits also to compute Taylor expansions of solutions of . The algorithm is implemented within a package in MAPLE

Sur le problème d’équivalence de Cartan

“…Si Ω et Ω sont donnés explicitement, l'étude de cette équation est relativement élémentaire, et peut se faire par les méthodes usuelles de l'algèbre différentielle (par exemple « l'algorithme de Rosenfeld-Gröbner » [6]. Si et seulement si l'un des deux est explicite et l'autre « indéterminé » au sens ci-dessous, Neut [35] remarque que les mêmes méthodes pourront être appliquées moyennant une élimination différentielle (sur ce dernier point, voir [33] et [38]).…”

An Algorithm for Converting Nonlinear Differential Equations to Integral Equations with an Application to Parameter Estimation from Noisy Data

“…See [5,8,9,6,7,17] and references therein. Using a differential elimination method [2] and a ranking that eliminates state variables:…”

Doing Algebraic Geometry with the RegularChains Library

“…The regularity test for regular chains is a powerful tool which has been studied and applied within many situations including polynomial algebra [6], differential algebra [2,5], and computing with algebraic numbers [4], etc. Broadly speaking, it allows to extend an algorithm working over a field into an algorithm working over a direct product of fields.…”