多项式矩阵秩剖面的秩敏感计算
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix
摘要:
考虑域$\mathbb{K}$上的一元多项式矩阵$\mathbf{F} \in \mathbb{K}[x]^{m \times n}$。研究了$\mathbf{F}$的列秩分布的计算问题。为此,我们首先给出了一个算法,它改进了Zhou,Labahn和Storjohann的最小核基算法(Proceedings ISSAC 2012)。然后,我们提供了第二个算法,该算法计算的列秩配置文件的$\mathbf{F}$与排名敏感的复杂性的$O\tilde{~}(r^{ω-2} n (m+D))$操作在$\mathbb{K}$。这里,$D$是$\mathbf{F}$的行度数之和,$ω$是矩阵乘法的指数,而$O\tilde{~}(\cdot)$隐藏对数因子。
英文摘要:
Consider a matrix $\mathbf{F} \in \mathbb{K}[x]^{m \times n}$ of univariate polynomials over a field $\mathbb{K}$. We study the problem of computing the column rank profile of $\mathbf{F}$. To this end we first give an algorithm which improves the minimal kernel basis algorithm of Zhou, Labahn, and Storjohann (Proceedings ISSAC 2012). We then provide a second algorithm which computes the column rank profile of $\mathbf{F}$ with a rank-sensitive complexity of $O\tilde{~}(r^{ω-2} n (m+D))$ operations in $\mathbb{K}$. Here, $D$ is the sum of row degrees of $\mathbf{F}$, $ω$ is the exponent of matrix multiplication, and $O\tilde{~}(\cdot)$ hides logarithmic factors.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。