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

零维多项式系统的无平方强三角分解

Square-free Strong Triangular Decomposition of Zero-dimensional Polynomial Systems

Haokun Li, Bican Xia, Tianqi Zhao

摘要:

具有不同性质的三角分解已被应用于几何定理证明、零维多项式系统的实解隔离等各种问题的求解中.本文定义了零维多项式系统的强链和无平方强三角分解的概念.由于其良好的性质,SFSTD可能成为解决许多与零维多项式系统有关的问题的关键途径,如零维理想的实解隔离和计算根。受Wang、Dong和Mou工作的启发,我们提出了一种基于格罗布纳基计算的SFSTD算法。算法的新颖之处在于利用饱和理想和分离子保证了任意两个强链的零集不相交,且每一个强链都是无平方的。一方面,我们证明了新算法的算术复杂性可以是变量数平方的单指数,这似乎是三角形分解方法的复杂性分析结果之一。另一方面,我们的实验表明,在大量的例子在文献中,新算法是远远高于流行的三角形分解方法的基础上伪划分更有效。此外,它也表明,在这些例子中,基于SFSTD的实解隔离和零维理想的根的计算方法是非常有效的。

英文摘要:

Triangular decomposition with different properties has been used for various types of problem solving, e.g. geometry theorem proving, real solution isolation of zero-dimensional polynomial systems, etc. In this paper, the concepts of strong chain and square-free strong triangular decomposition (SFSTD) of zero-dimensional polynomial systems are defined. Because of its good properties, SFSTD may be a key way to many problems related to zero-dimensional polynomial systems, such as real solution isolation and computing radicals of zero-dimensional ideals. Inspired by the work of Wang and of Dong and Mou, we propose an algorithm for computing SFSTD based on Gröbner bases computation. The novelty of the algorithm is that we make use of saturated ideals and separant to ensure that the zero sets of any two strong chains have no intersection and every strong chain is square-free, respectively. On one hand, we prove that the arithmetic complexity of the new algorithm can be single exponential in the square of the number of variables, which seems to be among the rare complexity analysis results for triangular-decomposition methods. On the other hand, we show experimentally that, on a large number of examples in the literature, the new algorithm is far more efficient than a popular triangular-decomposition method based on pseudo-division. Furthermore, it is also shown that, on those examples, the methods based on SFSTD for real solution isolation and for computing radicals of zero-dimensional ideals are very efficient.

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

↑