多项式矩阵的Hermite范式和行列式的快速确定性计算
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
摘要:
给出了域$\mathbb{K}$上一元多项式的非奇异$n \times n$矩阵的行列式和Hermite范式的快速确定性算法。我们的算法在$\mathbb{K}$中使用了$\widetilde{\mathcal{O}}(n^ω\lceil s \rceil)$操作,其中$s$由矩阵的行和列的度的平均值从上到下限定,并且$ω$是矩阵乘法的指数。软$O$符号表示省略大$O$中的对数因子,而天花板函数表示当$s = o(1)$时,成本为$\widetilde{\mathcal{O}}(n^ω)$。我们的算法是基于一个快速和确定性的三角化方法计算的非奇异矩阵的Hermite形式的对角项。
英文摘要:
Given a nonsingular $n \times n$ matrix of univariate polynomials over a field $\mathbb{K}$, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use $\widetilde{\mathcal{O}}(n^ω\lceil s \rceil)$ operations in $\mathbb{K}$, where $s$ is bounded from above by both the average of the degrees of the rows and that of the columns of the matrix and $ω$ is the exponent of matrix multiplication. The soft-$O$ notation indicates that logarithmic factors in the big-$O$ are omitted while the ceiling function indicates that the cost is $\widetilde{\mathcal{O}}(n^ω)$ when $s = o(1)$. Our algorithms are based on a fast and deterministic triangularization method for computing the diagonal entries of the Hermite form of a nonsingular matrix.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。