A bound for the Rosenfeld-Gröbner algorithm

• Autores: Oleg Golubitsky, Marina Kondratieva, Marc Moreno Maza, Alexey Ovchinnikov
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 43, Nº 8, 2008, págs. 582-610
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We consider the Rosenfeld�Gröbner 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�Gröbner algorithm, in which for every intermediate polynomial system F, the bound M(F)(n-1)!M(F0) holds, where F0 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