Generalized normal forms and polynomial system solving - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Generalized normal forms and polynomial system solving

Abstract

This report 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 Gröbner basis method and the Macaulay construction. As such it establishes a natural link between these two methods. We have weaken the monomial ordering requirement for Gröbner 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.
Fichier principal
Vignette du fichier
RR-5471.pdf (305.16 Ko) Télécharger le fichier

Dates and versions

inria-00070537 , version 1 (19-05-2006)

Identifiers

Cite

Bernard Mourrain, Philippe Trebuchet. Generalized normal forms and polynomial system solving. ISSAC 2005 - International Symposium on Symbolic and Algebraic Computation , Jul 2005, Beijing, China. pp.253-260, ⟨10.1145/1073884.1073920⟩. ⟨inria-00070537⟩
159 View
659 Download

Altmetric

Share

Gmail Facebook X LinkedIn More