arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.4870cs.SC
收藏

从近似因子分解到根隔离及其在柱形代数分解中的应用

From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition

Kurt Mehlhorn, Michael Sagraloff, Pengming Wang

摘要:

我们提出了一种算法,用于隔离的根的任意复杂的多项式$p$,也适用于多项式的多个根的不同的根的数量$k$作为输入的一部分。它输出$k$成对不相交的磁盘,每个磁盘包含$p$的不同根之一及其多重性。该算法使用近似因式分解作为子程序。此外,我们应用新的根隔离算法最近的算法计算的拓扑结构的一个真正的平面代数曲线指定为零集的二元整数多项式和隔离的二元多项式系统的真正的解决方案。对于输入多项式的次数$n$和位大小$τ$,我们提高了目前最好的运行时间从$\tO(n^{9}τ+n^{8}τ^{2})$(确定性)的$\tO(n^{6}+n^{5}τ)$(随机)的拓扑计算和从$\tO(n^{8}+n^{7}τ)$(确定性)的$\tO(n^{6}+n^{5}τ)$(随机)解决二元系统。

英文摘要:

We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also works for polynomials with multiple roots provided that the number $k$ of distinct roots is given as part of the input. It outputs $k$ pairwise disjoint disks each containing one of the distinct roots of $p$, and its multiplicity. The algorithm uses approximate factorization as a subroutine. In addition, we apply the new root isolation algorithm to a recent algorithm for computing the topology of a real planar algebraic curve specified as the zero set of a bivariate integer polynomial and for isolating the real solutions of a bivariate polynomial system. For input polynomials of degree $n$ and bitsize $τ$, we improve the currently best running time from $\tO(n^{9}τ+n^{8}τ^{2})$ (deterministic) to $\tO(n^{6}+n^{5}τ)$ (randomized) for topology computation and from $\tO(n^{8}+n^{7}τ)$ (deterministic) to $\tO(n^{6}+n^{5}τ)$ (randomized) for solving bivariate systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑