Probabilistic Algorithms for Computing Resolvent Representations of Regular Differential Ideals

Evelyne Hubert 1 Thomas Cluzeau 1
1 CAFE - Computer algebra and functional equations
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : In a previous article, we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing such representations. We propose two different approaches. The first one uses differential characteristic decompositions whereas the second one proceeds by prolongation and algebraic elimination. Both constructions depend on the choice of a tuple over the differential base field and their success relies on the chosen tuple to be separating. The probabilistic aspect of the algorithms comes from this choice. To control it, we exhibit a family of tuples for which we can bound the probability that one of its element is separating.
Document type :
Journal articles
Complete list of metadatas

Cited literature [42 references]  Display  Hide  Download

https://hal.inria.fr/inria-00089287
Contributor : Evelyne Hubert <>
Submitted on : Thursday, August 17, 2006 - 11:12:15 AM
Last modification on : Thursday, January 11, 2018 - 4:23:47 PM
Long-term archiving on : Monday, April 5, 2010 - 10:40:01 PM

Identifiers

Collections

Citation

Evelyne Hubert, Thomas Cluzeau. Probabilistic Algorithms for Computing Resolvent Representations of Regular Differential Ideals. AAECC, springer, 2008, 19 (5), pp.365-392. ⟨10.1007/s00200-008-0079-8⟩. ⟨inria-00089287⟩

Share

Metrics

Record views

228

Files downloads

128