一种计算格罗布纳基的面向单式的GVW
A Monomial-Oriented GVW for Computing Gröbner Bases
摘要:
Gao等人提出的GVW算法,是一个基于签名的算法,用于计算格罗布纳基。在本文中,GVW的一个变种。这种新的算法被称为单名导向的GVW算法或mo-GVW算法。mo-GVW算法提出了一种新的GVW算法框架,并将{ \em标号单项式}代替{ \em标号多项式}作为算法的基本元素。与原始GVW算法不同,mo-GVW算法对于每个标记单项式,努力寻找能够生成该单项式的最小签名。mo-GVW算法还避免了生成J-对,并使用有效的方法来搜索约简和检查准则。因此,mo-GVW算法在实际应用中具有较好的性能。
英文摘要:
The GVW algorithm, presented by Gao et al., is a signature-based algorithm for computing Gröbner bases. In this paper, a variant of GVW is presented. This new algorithm is called a monomial-oriented GVW algorithm or mo-GVW algorithm for short. The mo-GVW algorithm presents a new frame of GVW and regards {\em labeled monomials} instead of {\em labeled polynomials} as basic elements of the algorithm. Being different from the original GVW algorithm, for each labeled monomial, the mo-GVW makes efforts to find the smallest signature that can generate this monomial. The mo-GVW algorithm also avoids generating J-pairs, and uses efficient methods of searching reducers and checking criteria. Thus, the mo-GVW algorithm has a better performance during practical implementations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。