半群代数上的Gr {ö} bner基:稀疏多项式系统的算法与应用
Gr{ö}bner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems
摘要:
Gr {<$} bner基是算法非线性代数中最有力的工具之一。它们的计算是一个本质上很难的问题,其复杂性至少是变量数量的单指数。然而,在大多数情况下,来自应用程序的多项式系统具有某种结构。例如,计算机辅助设计、机器人、视觉、生物学、运动学、密码学和优化中的几个问题涉及稀疏系统,其中输入多项式具有一些非零项。我们利用稀疏性的方法是将系统嵌入到一个半群代数中,并计算这个代数上的Gr {<$} bner基。到目前为止,遵循这种方法的算法仅在所有多项式具有相同的稀疏结构(即相同的牛顿多面体)的情况下才受益于稀疏性。我们介绍的第一个算法,克服了这一限制。在正则性假设下,它不执行冗余计算。进一步,我们将该算法推广到计算标准代数中的Gr {<$} bner基和求解环面$(C*)^n$上的稀疏多项式系统.算法的复杂度取决于牛顿多面体。
英文摘要:
Gr{ö}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases, the polynomial systems coming from applications have some kind of structure. For example , several problems in computer-aided design, robotics, vision, biology , kinematics, cryptography, and optimization involve sparse systems where the input polynomials have a few non-zero terms. Our approach to exploit sparsity is to embed the systems in a semigroup algebra and to compute Gr{ö}bner bases over this algebra. Up to now, the algorithms that follow this approach benefit from the sparsity only in the case where all the polynomials have the same sparsity structure, that is the same Newton polytope. We introduce the first algorithm that overcomes this restriction. Under regularity assumptions, it performs no redundant computations. Further, we extend this algorithm to compute Gr{ö}bner basis in the standard algebra and solve sparse polynomials systems over the torus $(C*)^n$. The complexity of the algorithm depends on the Newton polytopes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。