实多项式的根加细
Root Refinement for Real Polynomials
摘要:
本文考虑无平方根多项式$f$的所有实根的逼近问题。给定隔离区间,我们的算法将每个根细化到$2^{-L}$或更小的宽度,即每个根近似为二进制点之后的$L$位。该方法只考虑多项式系数的有限逼近,并自适应地选择合适的工作精度,对任意实多项式都能给出一个有证的解。这样,我们得到了一个正确的算法,是简单的实现和实际有效的。我们的算法使用二次区间细化方法,我们适应的方法,以能够应付不准确的评估时,$f$,而不牺牲其二次收敛行为。我们证明了我们的算法的位复杂度的多项式的程度,大小和分离的根,即,参数完全相关的根的几何位置的约束。我们的界限是接近最优的,并显着提高了以前的工作整数多项式。此外,它基本上匹配最知名的理论界的根近似,这是通过非常复杂的算法。我们还调查了算法的实际行为,并展示了如何密切的实际性能匹配我们的渐近界。
英文摘要:
We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits after the binary point. Our method provides a certified answer for arbitrary real polynomials, only considering finite approximations of the polynomial coefficients and choosing a suitable working precision adaptively. In this way, we get a correct algorithm that is simple to implement and practically efficient. Our algorithm uses the quadratic interval refinement method; we adapt that method to be able to cope with inaccuracies when evaluating $f$, without sacrificing its quadratic convergence behavior. We prove a bound on the bit complexity of our algorithm in terms of the degree of the polynomial, the size and the separation of the roots, that is, parameters exclusively related to the geometric location of the roots. Our bound is near optimal and significantly improves previous work on integer polynomials. Furthermore, it essentially matches the best known theoretical bounds on root approximation which are obtained by very sophisticated algorithms. We also investigate the practical behavior of the algorithm and demonstrate how closely the practical performance matches our asymptotic bounds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。