arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.06428cs.CCcs.SCmath.AGmath.PR
收藏

根隔离算法的超越最坏情况分析

Beyond Worst-Case Analysis for Root Isolation Algorithms

Alperen A. Ergür, Josué Tonelli-Cueto, Elias Tsigaridas

摘要:

一元多项式实根的分离是符号计算中的一个基本问题,也是计算数学中最重要的问题之一。这个问题有着悠久的历史,装饰着许多巧妙的算法,并成为一个活跃的研究领域。然而,最坏情况下的寻根算法的分析并不相关的实际性能。我们开发了一个平滑的分析框架多项式与整数系数之间的差距,复杂性估计和实际性能。在此设置中,我们推导出DESCARTES求解器隔离多项式的实根的预期位复杂度,其中系数均匀分布,为$\widetilde{\mathcal{O}}_B(d^2 + d τ)$,其中$d$是多项式的次数,$τ$是系数的位大小。

英文摘要:

Isolating the real roots of univariate polynomials is a fundamental problem in symbolic computation and it is arguably one of the most important problems in computational mathematics. The problem has a long history decorated with numerous ingenious algorithms and furnishes an active area of research. However, the worst-case analysis of root-finding algorithms does not correlate with their practical performance. We develop a smoothed analysis framework for polynomials with integer coefficients to bridge the gap between the complexity estimates and the practical performance. In this setting, we derive that the expected bit complexity of DESCARTES solver to isolate the real roots of a polynomial, with coefficients uniformly distributed, is $\widetilde{\mathcal{O}}_B(d^2 + d τ)$, where $d$ is the degree of the polynomial and $τ$ the bitsize of the coefficients.

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

↑