基于零点匹配方法的二元多项式系统实根并行计算
Parallel computation of real solving bivariate polynomial systems by zero-matching method
AI总结:
提出一种基于零点匹配方法的新算法,通过非零下界和邻域重数信息,并行计算有限解二元多项式系统的实根。
摘要:
我们提出了一种新算法,通过零点匹配方法求解具有有限个解的二元多项式系统 $\Sigma=\{f(x,y),g(x,y)\}$ 的实根。该方法基于二元多项式系统非零时的下界。此外,$\Sigma=0$ 的根的重数可以通过给定邻域获得。通过这种方法,该方法的并行化自然产生。利用多维匹配方法,该原理可以推广到多元方程组。
英文摘要:
We present a new algorithm for solving the real roots of a bivariate polynomial system $Σ=\{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 $Σ=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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。