Algorithms for Computing Triangular Decompositions of Polynomial Systems

Details Algorithms for Computing Triangular Decompositions of Polynomial Systems Algorithms for Computing Triangular Decompositions of Polynomial Systems

2011-04-04

arxiv.org/abs/1104.0689v1

Computer Science

Symbolic Computation

Scientific paper

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which permits to greatly simplify and optimize the sub-algorithms. Extracting common work from similar expensive computations is also a key feature of our algorithms. In our experimental results the implementation of our new algorithms, realized with the {\RegularChains} library in {\Maple}, outperforms solvers with similar specifications by several orders of magnitude on sufficiently difficult problems.

Affiliated with

Also associated with

No associations

Rating

Algorithms for Computing Triangular Decompositions of Polynomial Systems 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 Algorithms for Computing Triangular Decompositions of Polynomial Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Computing Triangular Decompositions of Polynomial Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-320424