计算一元多项式的$μ$ -基的算法
Algorithm for computing $μ$-bases of univariate polynomials
摘要:
本文给出了计算任意域$\mathbb{K}$上单变量$n$多项式的合冲模的$μ$ -基的一个新算法。该算法在概念上不同于Cox、Sederberg、Chen、Zheng和Wang为$n=3$开发的算法,以及Song和Goldman为任意$n$开发的算法。它涉及计算$\mathbb{K}$上的$ (2d+1)\times n(d+1)$矩阵的“部分”简化行梯队形式,其中$d$是输入多项式的最大次数。该算法的证明是基于标准的线性代数,是完全独立的。它包括一个存在的$μ$ -基础的证明,并作为一个结果提供了一个替代的证明的免费的syzygy模块。该算法的理论(最坏情况渐近)计算复杂性为$O(d^2n+d^3+n^2)$。我们已经实现了这个算法(HHK)和宋和高盛(SG)开发的一个。对随机输入的实验表明,当$d$对于固定的$n$变得足够大时,SG比HHK快,并且当$n$对于固定的$d$变得足够大时,HHK比SG快。
英文摘要:
We present a new algorithm for computing a $μ$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox, Sederberg, Chen, Zheng, and Wang for $n=3$, and by Song and Goldman for an arbitrary $n$. It involves computing a "partial" reduced row-echelon form of a $ (2d+1)\times n(d+1)$ matrix over $\mathbb{K}$, where $d$ is the maximum degree of the input polynomials. The proof of the algorithm is based on standard linear algebra and is completely self-contained. It includes a proof of the existence of the $μ$-basis and as a consequence provides an alternative proof of the freeness of the syzygy module. The theoretical (worst case asymptotic) computational complexity of the algorithm is $O(d^2n+d^3+n^2)$. We have implemented this algorithm (HHK) and the one developed by Song and Goldman (SG). Experiments on random inputs indicate that SG gets faster than HHK when $d$ gets sufficiently large for a fixed $n$, and that HHK gets faster than SG when $n$ gets sufficiently large for a fixed $d$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。