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

关于复多项式牛顿法的高效全局动力学

On the Efficient Global Dynamics of Newton's Method for Complex Polynomials

Jacobs University Bremen(不来梅雅各布斯大学)

Dierk Schleicher

AI总结:

本文研究牛顿法作为任意次数复多项式求根方法的理论复杂度,证明其在已知起始点集下近乎最优,并通过实验展示其实际效率远超理论界,甚至能在O(d log d)复杂度内求解超过一亿次的多项式。

摘要:

我们研究牛顿法作为任意次数复多项式的求根方法。虽然多项式求根仍然是计算的基本任务之一,在理论数学、数值计算、计算机图形学和物理学的所有领域都有重要应用,但已知的方法要么具有出色的理论复杂度但无法在实践中使用,要么实际高效但缺乏成功的理论支持。在本文中,我们描述了牛顿法求给定次数多项式所有根的理论复杂度,并证明对于已知的能求出所有根的起始点集,该复杂度是近乎最优的。这一理论结果得到了最近实现的牛顿法的补充,该方法能求出次数超过一百万的各种多项式的所有根,速度显著快于我们的复杂度上界所指示的,并且通常比已建立的快速求根器快得多。在一些实验中,即使次数超过一亿,也能以O(d log d)的复杂度求出所有根。因此,牛顿法作为一种从理论和实践角度都具有优势的方法脱颖而出。我们的研究基于已知的显式通用起始点集,该集合保证能求出次数为d(适当归一化)的多项式的所有根。我们证明该集合包含d个点,它们非常快速地收敛到d个根:求出所有根达到精度ε所需的牛顿迭代总次数的期望为O(d^3 log^3 d + d log|log ε|),这可以进一步改进为O(d^2 log^4 d + d log|log ε|);在最坏情况下允许近重根时,复杂度为O(d^4 log^2 d + d^3 log^2 d |log ε|)。所有这些估计的算术复杂度与牛顿迭代步数相同,相差不超过log^2 d因子。

英文摘要:

We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical mathematics, numerics, computer graphics and physics, known methods have either excellent theoretical complexity but cannot be used in practice, or are practically efficient but are a lacking a successful theory behind them. In this manuscript we describe the theoretical complexity of Newton's method for finding all roots of polynomials of given degree and show that it is near-optimal for the known set of starting points that find all roots. This theoretical result is complemented by a recent implementation of Newton's method that finds all roots of various polynomials of degree more than a million, significantly faster than our upper bounds on the complexity indicate, and often much faster than established fast root finders. In some experiments, it was possible to find all roots even with complexity $O(d\log d)$ for degrees exceeding 100 million. Newton's method thus stands out as a method that has merits both from the theoretical and from the practical point of view. Our study is based on the known explicit set of universal starting points that is guaranteed to find all roots of polynomials of degree $d$ (appropriately normalized). We show that this set contains $d$ points that converge very quickly to the $d$ roots: the expected total number of Newton iterations required to find all roots with precision $\eps$ is $O(d^3\log^3d+d\log|\log\eps|)$, which can be further improved to $O(d^2\log^4d+d\log|\log\eps|)$; in the worst case allowing near-multiple roots, the complexity is $O(d^4\log^2d+d^3\log^2d|\log\eps|)$. The arithmetic complexity for all these estimates is the same as the number of Newton iterations steps, up to a factor of $\log^2 d$.

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

↑