计算对合基的Gerdt算法的一种变形
A Variant of Gerdt's Algorithm for Computing Involutive Bases
摘要：
第一作者提出了一个计算对合（和约化Groebner）基的有效算法。在本文中，我们考虑修改这个算法，简化了理解它和实现的问题。我们证明了修改后的算法的正确性和终止性以及所使用的准则的正确性。该算法已在Maple中实现。我们目前的实验比较，通过一些例子，修改后的算法，其原始形式已在Maple中实现的性能。在这样做的时候，我们已经注意到提供统一的实现细节的两个算法。
英文摘要：
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove correctness and termination of the modified algorithm and also correctness of the used criteria. The proposed algorithm has been implemented in Maple. We present experimental comparison, via some examples, of performance of the modified algorithm with its original form which has been implemented in Maple too. In doing so, we have taken care to provide uniform implementation details for the both algorithms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
