截断正则形式用于求解多项式系统:通用且高效的算法
Truncated Normal Forms for Solving Polynomial Systems: Generalized and Efficient Algorithms
AI总结:
本文提出了一种通用且高效的算法,利用截断正则形式来求解多项式系统的孤立公共根,并通过实验展示了该方法的潜力和新结果的实用性。
摘要:
我们考虑了求解一组定义了零维理想I的多项式函数的孤立公共根的问题。正则形式算法提供了一种代数方法来解决这个问题。Telen等人(2018)所提出的框架使用截断正则形式(TNFs)来计算R/I的代数结构和I的解。该框架允许使用比标准单项式更一般的基。本文利用这一点,引入了两种特殊(非单项式)类型的基函数,具有良好的性质。这允许例如将基函数适应到I的根的预期位置。我们还提出了高效计算TNFs的算法以及在非通用零维系统情况下的TNFs构造的一般化方法。通过许多实验展示了TNF方法的潜力和新结果的实用性。
英文摘要:
We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem. The framework presented in Telen et al. (2018) uses truncated normal forms (TNFs) to compute the algebra structure of R/I and the solutions of I. This framework allows for the use of much more general bases than the standard monomials for R/I. This is exploited in this paper to introduce the use of two special (nonmonomial) types of basis functions with nice properties. This allows, for instance, to adapt the basis functions to the expected location of the roots of I. We also propose algorithms for efficient computation of TNFs and a generalization of the construction of TNFs in the case of non-generic zero-dimensional systems. The potential of the TNF method and usefulness of the new results are exposed by many experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。