Details:
Title  Stable normal forms for polynomial system solving  Author(s)  Bernard Mourrain, Philippe Trebuchet  Type  Article in Journal  Abstract  The paper describes and analyzes a method for computing border bases of a zerodimensional ideal I . The criterion used in the computation involves specific commutation polynomials, and leads to an algorithm and an implementation extending the ones in [B. Mourrain, Ph. Trébuchet, Generalised normal forms and polynomial system solving, in: M. Kauers (Ed.), Proc. Intern. Symp. on Symbolic and Algebraic Computation, ACM Press, NewYork, 2005, pp. 253–260]. This general border basis algorithm weakens the monomial ordering requirement for Gröbner bases computations. It is currently the most general setting for representing quotient algebras, embedding into a single formalism Gröbner bases, Macaulay bases and a new representation that does not fit into the previous categories. With this formalism, we show how the syzygies of the border basis are generated by commutation relations. We also show that our construction of normal form is stable under small perturbations of the ideal, if the number of solutions remains constant. This feature has a huge impact on practical efficiency, as illustrated by the experiments on classical benchmark polynomial systems, at the end of the paper.  Keywords  Multivariate polynomial, Quotient algebra, Normal form, Border basis, Rootfinding, Symbolicnumeric computation  ISSN  03043975 
URL 
http://www.sciencedirect.com/science/article/pii/S0304397508006427 
Language  English  Journal  Theoretical Computer Science  Volume  409  Number  2  Pages  229  240  Year  2008  Note  SymbolicNumerical Computations  Edition  0  Translation 
No  Refereed 
No 
