arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1010.1764cs.SC
收藏

使用连分式改进实根隔离的复杂度界

Improved complexity bounds for real root isolation using Continued Fractions

Elias Tsigaridas

摘要:

我们考虑的问题,隔离的平方与整数系数的多项式的实根使用(变种)的连分式算法(CF)。本文介绍了一种计算一元多项式正实根下界的新方法。这使我们能够推导出一个最坏情况下的界限$\sOB(d^6 + d^4τ^2 + d^3τ^2)$隔离的实根多项式的整数系数使用经典的CF的变体,其中$d$是多项式的次数和$τ$的最大位大小的系数。这将Sharma \cite{sharma-tcs-2008}之前的边界改进了一个因子$d^3$,并与Mehlhorn和Ray \cite{mr-jsc-2009}为CF的另一个变体推导的边界相匹配;它还与基于细分的求解器的最差情况边界相匹配。我们提出了一个新的变种CF,我们称之为iCF,隔离的实根的多项式与整数系数在$\sOB(d^5+d^4τ)$,从而提高了目前已知的约束问题的一个因素$d$。如果多项式只有实根,那么我们的界限就变成了$\sOB(d^4+d^3τ+ d^2τ^2)$,从而与Reif \cite{r-focs-1993}和Ben-Or和Tiwari \cite{bt-joc-1990}的数值算法的界限相匹配。实际上,后一个界限在更一般的设置中成立,即在相当温和的假设下,即$Ω(d/\lg^c{d})$,其中$c\geq 0$是常数,根有助于多项式的系数列表的符号变化。这是唯一的约束精确算法,匹配的数值算法之一,潘\cite{Pan02jsc}和Schönhage \cite{Sch82}。据我们所知,提出的界限是最有名的问题,真正的根隔离算法的基础上精确计算。

英文摘要:

We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real roots of univariate polynomials. This allows us to derive a worst case bound of $\sOB(d^6 + d^4τ^2 + d^3τ^2)$ for isolating the real roots of a polynomial with integer coefficients using the classic variant of CF, where $d$ is the degree of the polynomial and $τ$ the maximum bitsize of its coefficients. This improves the previous bound by Sharma \cite{sharma-tcs-2008} by a factor of $d^3$ and matches the bound derived by Mehlhorn and Ray \cite{mr-jsc-2009} for another variant of CF; it also matches the worst case bound of the subdivision-based solvers. We present a new variant of CF, we call it iCF, that isolates the real roots of a polynomial with integer coefficients in $\sOB(d^5+d^4τ)$, thus improving the current known bound for the problem by a factor of $d$. If the polynomial has only real roots, then our bound becomes $\sOB(d^4+d^3τ+ d^2τ^2)$, thus matching the bound of the numerical algorithms by Reif \cite{r-focs-1993} and by Ben-Or and Tiwari \cite{bt-joc-1990}. Actually the latter bound holds in a more general setting, that is under the rather mild assumption that $Ω(d/\lg^c{d})$, where $c\geq 0$ is a constant, roots contribute to the sign variations of the coefficient list of the polynomial. This is the only bound on exact algorithms that matches the one of the numerical algorithms by Pan \cite{Pan02jsc} and Schönhage \cite{Sch82}. To our knowledge the presented bounds are the best known for the problem of real root isolation for algorithms based on exact computations.

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

↑