Parallel computation of real solving bivariate polynomial systems by zero-matching method

Details Parallel computation of real solving bivariate polynomial systems by zero-matching method Parallel computation of real solving bivariate polynomial systems by zero-matching method

2010-01-18

arxiv.org/abs/1001.2940v1

Computer Science

Symbolic Computation

10 pages

Scientific paper

We present a new algorithm for solving the real roots of a bivariate polynomial system $\Sigma=\{f(x,y),g(x,y)\}$ with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for bivariate polynomial system when the system is non-zero. Moreover, the multiplicities of the roots of $\Sigma=0$ can be obtained by a given neighborhood. From this approach, the parallelization of the method arises naturally. By using a multidimensional matching method this principle can be generalized to the multivariate equation systems.

Affiliated with

Also associated with

No associations

Rating

Parallel computation of real solving bivariate polynomial systems by zero-matching method 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 Parallel computation of real solving bivariate polynomial systems by zero-matching method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel computation of real solving bivariate polynomial systems by zero-matching method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-659499