Generalized normal forms and polynomial system solving

B. M. et P. Trebuchet


This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its correctness, and finally experimentations on classical benchmark polynomial systems. The method that we propose can be thought as an extension of both the Groebner basis method and the Macaulay construction. We have weaken the monomial ordering requirement for Groebner bases computations, which allows us to construct new type of representations for the associated quotient algebra. This approach yields more freedom in the linear algebra steps involved, which allows us to take into account numerical criteria while performing the symbolic steps. This is a new feature for a symbolic algorithm, which has an important impact on the practical efficiency, as it is illustrated by the experiments at the end of the paper.