arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.13784cs.SC
收藏

一种用于计算多项式系统非退化轨迹的基于符号(Signature)的算法

A Signature-based Algorithm for Computing the Nondegenerate Locus of a Polynomial System

Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din

AI总结:

针对多项式系统求解中的退化问题,提出一种基于Signature的Gröbner基算法,无需先计算全系统Gröbner基即可得到非退化轨迹闭包方程的Gröbner基,改进了传统理想论方法的计算流程。

摘要:

多项式系统求解在众多应用领域中用于建模非线性几何特性。在这类场景中,多项式系统可能存在退化情况,而最终用户希望将其从解集中排除。多项式系统的非退化轨迹是指解集的余维数与方程个数相等的点的集合。传统上,计算非退化轨迹是通过交换代数中的理想论操作来完成的,例如饱和理想或等维分解,以提取最大余维数的分量。通过利用基于符号(Signature)的Gröbner基算法的代数特性,我们设计了一种算法,该算法无需先计算整个多项式系统的Gröbner基,就能计算出描述多项式系统非退化轨迹闭包的方程的Gröbner基。

英文摘要:

Polynomial system solving arises in many application areas to model non-linear geometric properties. In such settings, polynomial systems may come with degeneration which the end-user wants to exclude from the solution set. The nondegenerate locus of a polynomial system is the set of points where the codimension of the solution set matches the number of equations. Computing the nondegenerate locus is classically done through ideal-theoretic operations in commutative algebra such as saturation ideals or equidimensional decompositions to extract the component of maximal codimension. By exploiting the algebraic features of signature-based Gröbner basis algorithms we design an algorithm which computes a Gröbner basis of the equations describing the closure of the nondegenerate locus of a polynomial system, without computing first a Gröbner basis for the whole polynomial system.

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

↑