arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.03526math.NAcs.NA
收藏

求解多项式方程组的范式算法分析

Analysis of Normal-Form Algorithms for Solving Systems of Polynomial Equations

Suzanna Parkinson, Hayden Ringer, Kate Wall, Erik Parkinson, Lukas Erekson, Daniel Christensen, Tyler J. Jarvis

AI总结:

本文分析 Telen、Mourrain 与 Van Barel 的多元多项式范式求根算法及其变体,通过复杂度评估和数值实验揭示其在根高度接近时的失效问题,并剖析“毁灭性示例”。

摘要:

我们考察了 Telen、Mourrain 和 Van Barel 的若干范式多元多项式求根方法及其部分变体。我们从渐近时间复杂度以及在大量数值实验中的速度和精度方面,分析了这些变体的性能。当许多根彼此非常接近时,该算法的所有变体都会出现问题。我们详细分析了在一个此类系统上的性能,即 Noferini 和 Townsend 用来证明基于结式方法不稳定性的“毁灭性示例”。

英文摘要:

We examine several of the normal-form multivariate polynomial rootfinding methods of Telen, Mourrain, and Van Barel and some variants of those methods. We analyze the performance of these variants in terms of their asymptotic temporal complexity as well as speed and accuracy on a wide range of numerical experiments. All variants of the algorithm are problematic for systems in which many roots are very close together. We analyze performance on one such system in detail, namely the 'devastating example' that Noferini and Townsend used to demonstrate instability of resultant-based methods.

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

↑