Bounds for algorithms in differential algebra

Details Bounds for algorithms in differential algebra Bounds for algorithms in differential algebra

2007-02-16

arxiv.org/abs/math/0702470v1

Journal of Symbolic Computation 43 (8) (2008) 582-610

Mathematics

Commutative Algebra

40 pages

Scientific paper

10.1016/j.jsc.2007.12.002

We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F, let M(F) be the sum of maximal orders of differential indeterminates occurring in F. We propose a modification of the Rosenfeld-Groebner algorithm, in which for every intermediate polynomial system F, the bound M(F) is less than or equal to (n-1)!M(G), where G is the initial set of generators of the radical ideal. In particular, the resulting regular systems satisfy the bound. Since regular ideals can be decomposed into characterizable components algebraically, the bound also holds for the orders of derivatives occurring in a characteristic decomposition of a radical differential ideal. We also give an algorithm for converting a characteristic decomposition of a radical differential ideal from one ranking into another. This algorithm performs all differentiations in the beginning and then uses a purely algebraic decomposition algorithm.

Affiliated with

Also associated with

No associations

Rating

Bounds for algorithms in differential algebra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds for algorithms in differential algebra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds for algorithms in differential algebra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-196594