Stable normal forms for polynomial system solving

This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending the one provided in [29]. This general border basis algorithm weakens the monomial ordering requirement for Gr

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Bernard Mourrain, Philippe Trebuchet
• Keywords: Border Basis, CORR 2008, Education, Gr¨obner Bases, Specific Commutation Polynomials