多项式矩阵行列式的快速确定性计算
Fast and deterministic computation of the determinant of a polynomial matrix
摘要:
给定域$\mathbb{K}$上一元多项式$\mathbf{F}\in\mathbb{K}[x]^{n\times n}$的平方非奇异矩阵,给出了求$\mathbf{F}$行列式的一个确定性算法.该算法的复杂度为$\bigO \left(n^ωs\right)$字段操作,其中$s$是$\mathbf{F}$的平均列度或平均行度。这里,$\bigO$表示法是省略对数因子的Big- $O$,$ω$是矩阵乘法的指数。
英文摘要:
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm is $\bigO \left(n^ωs\right)$ field operations where $s$ is the average column degree or the average row degree of $\mathbf{F}$. Here $\bigO$ notation is Big-$O$ with log factors omitted and $ω$ is the exponent of matrix multiplication.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。