Computer Science – Mathematical Software
Scientific paper
2010-10-07
Computer Science
Mathematical Software
16 pages with appendix, 1 figure, submitted to ALENEX 2010
Scientific paper
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of points. First, the amount of purely symbolic operations is significantly reduced, that is, only resultant computation and square-free factorization is still needed. Second, our algorithm neither assumes generic position of the input system nor demands for any change of the coordinate system. The latter is due to a novel inclusion predicate to certify that a certain region is isolating for a solution. Our implementation exploits graphics hardware to expedite the resultant computation. Furthermore, we integrate a number of filtering techniques to improve the overall performance. Efficiency of the proposed method is proven by a comparison of our implementation with two state-of-the-art implementations, that is, LPG and Maple's isolate. For a series of challenging benchmark instances, experiments show that our implementation outperforms both contestants.
Berberich Eric
Emeliyanenko Pavel
Sagraloff Michael
No associations
LandOfFree
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks 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 An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-509349