A Geometric Index Reduction Method for Implicit Systems of Differential Algebraic Equations

This paper deals with the index reduction problem for the class of quasi-regular DAE systems. It is shown that any of these systems can be transformed to a generically equivalent first order DAE system consisting of a single purely algebraic (polynomial) equation plus an under-determined ODE (that is, a semi-explicit DAE system of differentiation index 1) in as many variables as the order of the input system. This can be done by means of a Kronecker-type algorithm with bounded complexity

On the complexity of the resolvent representation of some prime differential ideals

We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential system for a particular class of ordinary first order algebraic-differential equations arising in control theory. We also exhibit a probabilistic algorithm which computes this resolvent representation within time polynomial in the natural syntactic parameters and the degree of a certain algebraic variety related to the input system. In addition, we give a probabilistic polynomial-time algorithm for the computation of the differential Hilbert function of the ideal. © 2005 Elsevier Inc. All rights reserved.Fil:Jeronimo, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Solernó, P. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina