Computer Science – Symbolic Computation
Scientific paper
2011-05-24
Computer Science
Symbolic Computation
Scientific paper
Lazard and Rouillier in [9], by introducing the concept of discriminant
variety, have described a new and efficient algorithm for solving parametric
polynomial systems. In this paper we modify this algorithm, and we show that
with our improvements the output of our algorithm is always minimal and it does
not need to compute the radical of ideals.
No associations
LandOfFree
A note on Solving Parametric 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 A note on Solving Parametric Polynomial Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on Solving Parametric Polynomial Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-515292