关于实根隔离的复杂性
On the Complexity of Real Root Isolation
摘要:
本文提出了一种新的方法来分离实系数无平方多项式$F=\sum_{i=0}^n A_i x^i$的实根。假设$F$的每个系数可以近似于任何指定的误差界。所提出的方法是精确的、完整的和确定的。由于它与笛卡尔方法相似,我们也认为它实用且易于实现。与以前的方法相比,我们的新方法实现了显着更好的位复杂度。它进一步表明,隔离真正的根$F$的硬度是完全由根的几何形状,而不是由复杂性或系数的大小。对于$F$具有整数系数的最大位大小$τ$的特殊情况,我们的位复杂度上的界限写为$\tilde{O}(n^3τ^2)$,其通过因子$n=deg F$改进了已知的现有实用算法的最佳界限。新方法的关键思想是运行笛卡尔方法的近似版本,在每个细分步骤中,我们只考虑中间结果的近似到一定的精度。我们给出了一个上界的最大精度是隔离的根$F$。对于整数多项式,该界限比使用精确算法解释位复杂度的改进界限时所需的精度低一个因子$n$。
英文摘要:
We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented method is exact, complete and deterministic. Due to its similarities to the Descartes method, we also consider it practical and easy to implement. Compared to previous approaches, our new method achieves a significantly better bit complexity. It is further shown that the hardness of isolating the real roots of $F$ is exclusively determined by the geometry of the roots and not by the complexity or the size of the coefficients. For the special case where $F$ has integer coefficients of maximal bitsize $τ$, our bound on the bit complexity writes as $\tilde{O}(n^3τ^2)$ which improves the best bounds known for existing practical algorithms by a factor of $n=deg F$. The crucial idea underlying the new approach is to run an approximate version of the Descartes method, where, in each subdivision step, we only consider approximations of the intermediate results to a certain precision. We give an upper bound on the maximal precision that is needed for isolating the roots of $F$. For integer polynomials, this bound is by a factor $n$ lower than that of the precision needed when using exact arithmetic explaining the improved bound on the bit complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。