Stable normal forms for polynomial system solving

Details Stable normal forms for polynomial system solving Stable normal forms for polynomial system solving

2008-11-29

arxiv.org/abs/0812.0067v1

Theoretical Computer Science 409, 2 (2008) 229-240

Computer Science

Symbolic Computation

Scientific paper

10.1016/j.tcs.2008.09.004

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 [MT'05]. This general border basis algorithm weakens the monomial ordering requirement for \grob bases computations. It is up to date the most general setting for representing quotient algebras, embedding into a single formalism Gr\"obner bases, Macaulay bases and new representation that do 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 new feature for a symbolic algorithm has a huge impact on the practical efficiency as it is illustrated by the experiments on classical benchmark polynomial systems, at the end of the paper.

Affiliated with

Also associated with

No associations

Rating

Stable normal forms for polynomial system solving does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stable normal forms for polynomial system solving, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stable normal forms for polynomial system solving will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-139783