Ore代数中基于结果的消元法
Resultant-based Elimination in Ore Algebra
摘要:
我们考虑基于结果的方法消除Ore代数中的Ore多项式系统的不确定性。首先定义二元Ore多项式结式的概念,然后用多项式系数的Dieudonne行列式计算。此外,我们应用非交换版本的评估和插值技术的计算过程中,以提高效率的方法。算法的实现将在Maple中进行,以评估方法的性能。
英文摘要:
We consider resultant-based methods for elimination of indeterminates of Ore polynomial systems in Ore algebra. We start with defining the concept of resultant for bivariate Ore polynomials then compute it by the Dieudonne determinant of the polynomial coefficients. Additionally, we apply noncommutative versions of evaluation and interpolation techniques to the computation process to improve the efficiency of the method. The implementation of the algorithms will be performed in Maple to evaluate the performance of the approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。