利用模多项式方程组快速计算多项式矩阵的移位Popov型
Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations
摘要:
给出了一个Las Vegas算法,该算法计算$m \times m$非奇异多项式矩阵的移位Popov形式,其中$d$次$d$在期望的$\widetilde{\mathcal{O}}(m^ωd)$域运算中,$ω$是矩阵乘法的指数,$\widetilde{\mathcal{O}}(\cdot)$表示省略了对数因子.这是$\widetilde{\mathcal{O}}(m^ωd)$中第一个用于任意移位的移位行约简的算法。使用部分线性化,我们减少了问题的情况下,$d \le \lceil σ/m \rceil$ $σ$是通用的行列式界,与$σ/ m$有界从上面的平均行度和平均列度的矩阵。上面的成本变成了$\widetilde{\mathcal{O}}(m^ω\lceil σ/m \rceil)$,改进了用于行减少的最快的先前已知算法的成本,这是确定性的。我们的算法首先建立一个系统的模块化方程组的解集是行空间的输入矩阵,然后找到这个集合的移位波波夫形式的基础。我们给出了一个确定性的算法,支持任意模在$\widetilde{\mathcal{O}}(m^{ω-1} σ)$字段操作,其中$m$是未知数的数量和$σ$是模的程度的总和的第二步。这扩展了以前的结果,在特定情况下的顺序基计算和M-Padé近似,其中的模是已知的线性因子的产品相同的成本范围。
英文摘要:
We give a Las Vegas algorithm which computes the shifted Popov form of an $m \times m$ nonsingular polynomial matrix of degree $d$ in expected $\widetilde{\mathcal{O}}(m^ωd)$ field operations, where $ω$ is the exponent of matrix multiplication and $\widetilde{\mathcal{O}}(\cdot)$ indicates that logarithmic factors are omitted. This is the first algorithm in $\widetilde{\mathcal{O}}(m^ωd)$ for shifted row reduction with arbitrary shifts. Using partial linearization, we reduce the problem to the case $d \le \lceil σ/m \rceil$ where $σ$ is the generic determinant bound, with $σ/ m$ bounded from above by both the average row degree and the average column degree of the matrix. The cost above becomes $\widetilde{\mathcal{O}}(m^ω\lceil σ/m \rceil)$, improving upon the cost of the fastest previously known algorithm for row reduction, which is deterministic. Our algorithm first builds a system of modular equations whose solution set is the row space of the input matrix, and then finds the basis in shifted Popov form of this set. We give a deterministic algorithm for this second step supporting arbitrary moduli in $\widetilde{\mathcal{O}}(m^{ω-1} σ)$ field operations, where $m$ is the number of unknowns and $σ$ is the sum of the degrees of the moduli. This extends previous results with the same cost bound in the specific cases of order basis computation and M-Padé approximation, in which the moduli are products of known linear factors.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。