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

一元多项式逼近的新数据结构及其在根隔离、数值多点求值和其它问题中的应用

New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems

Guillaume Moroz

摘要:

我们提出了一种新的数据结构,以近似准确和有效的多项式$f$度$d$作为一个列表的系数。它的属性,使我们能够提高国家的最先进的边界上的位复杂性的根隔离和近似多点评估的问题。该数据结构还导致了检测病态多项式的新的几何准则,这意味着多项式的零点的标准条件数在小于$1/2$或大于$2$的模的根的数目中至少是指数的。给定次数为$d$的多项式$f$,其中$\|f\|_1 \leq 2^τ$用于$τ\geq 1$,隔离其所有复数根或在$d$点处对其求值可以用准线性数量的算术运算来完成。然而,考虑到比特复杂度,即使对于条件良好的多项式并且当所需的精度较低时,现有技术的算法也至少需要$d^{3/2}$比特操作。给定一个正整数$m$,我们可以计算我们的新数据结构,并在单位磁盘中的$d$点处评估$f$,其绝对误差小于$\widetilde O(d(τ+m))$位操作中的$2^{-m}$,其中$\widetilde O(\cdot)$意味着我们省略对数因子。如果$κ$是$f$的零的绝对条件数,则可以在$\widetilde O(d(τ+ \log κ))$位运算中分离出$f$的所有根.此外,我们的算法是简单的实现。为了逼近多项式的复数根,我们在\verb中实现了一个小的原型|Python/NumPy|对于具有随机系数的高次多项式,这比最先进的求解器\verb /MPSolve/快一个数量级。

英文摘要:

We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients. Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems of root isolation and approximate multipoint evaluation. This data structure also leads to a new geometric criterion to detect ill-conditioned polynomials, implying notably that the standard condition number of the zeros of a polynomial is at least exponential in the number of roots of modulus less than $1/2$ or greater than $2$.Given a polynomial $f$ of degree $d$ with $\|f\|_1 \leq 2^τ$ for $τ\geq 1$, isolating all its complex roots or evaluating it at $d$ points can be done with a quasi-linear number of arithmetic operations. However, considering the bit complexity, the state-of-the-art algorithms require at least $d^{3/2}$ bit operations even for well-conditioned polynomials and when the accuracy required is low. Given a positive integer $m$, we can compute our new data structure and evaluate $f$ at $d$ points in the unit disk with an absolute error less than $2^{-m}$ in $\widetilde O(d(τ+m))$ bit operations, where $\widetilde O(\cdot)$ means that we omit logarithmic factors. We also show that if $κ$ is the absolute condition number of the zeros of $f$, then we can isolate all the roots of $f$ in $\widetilde O(d(τ+ \log κ))$ bit operations. Moreover, our algorithms are simple to implement. For approximating the complex roots of a polynomial, we implemented a small prototype in \verb|Python/NumPy| that is an order of magnitude faster than the state-of-the-art solver \verb/MPSolve/ for high degree polynomials with random coefficients.

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

↑