多项式系统求解的稳定范式
Stable normal forms for polynomial system solving
摘要:
本文描述和分析了零维理想$I$的边界基的一种计算方法。在计算中使用的标准涉及特定的换流多项式,并导致一种算法和一种实现,扩展了[MT'05]中提供的算法和实现。这种通用的边界基算法削弱了\grob基计算的单项排序要求。它是最新的最一般的设置表示商代数,嵌入到一个单一的形式主义格罗布纳基,麦考利基地和新的表示,不适合到以前的类别。有了这种形式主义,我们展示了边界基的合冲如何由对易关系产生。我们还表明,我们的范式的建设是稳定的理想的小扰动下,如果解决方案的数量保持不变。符号算法的这一新特性对实际效率有着巨大的影响,在文章的最后,经典基准多项式系统上的实验说明了这一点。
英文摘要:
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending the one provided in [MT'05]. This general border basis algorithm weakens the monomial ordering requirement for \grob bases computations. It is up to date the most general setting for representing quotient algebras, embedding into a single formalism Gröbner bases, Macaulay bases and new representation that do not fit into the previous categories. With this formalism we show how the syzygies of the border basis are generated by commutation relations. We also show that our construction of normal form is stable under small perturbations of the ideal, if the number of solutions remains constant. This new feature for a symbolic algorithm has a huge impact on the practical efficiency as it is illustrated by the experiments on classical benchmark polynomial systems, at the end of the paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。