任意移位Popov型最小插值基的快速计算
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts
摘要:
我们计算的一般插值问题,其中包括Hermite-Padé逼近和约束多元插值的解决方案的最小基地,并在编码理论和安全的应用。这个问题要求找到大小为$σ$的$m$向量之间的单变量多项式关系;这些关系相对于输入度偏移应该具有小的度。对于任意移位,我们提出了一种计算移位Popov范式中插值基的算法,其代价为$\mathcal{O}\tilde{~}(m^{ω-1} σ)$域运算,其中$ω$是矩阵乘法的指数,符号$\mathcal{O}\tilde{~}(\cdot)$表示省略了对数项.早期的工作,在厄米-帕德逼近的情况下,在一般插值的情况下,计算非正规化的基础。由于对于任意移位,这样的基可能具有大小$Θ(m^2 σ)$,因此成本约束$\mathcal{O}\tilde{~}(m^{ω-1} σ)$仅在确保小输出大小的移位的限制性假设下是可行的。处理具有相同复杂性界限的任意移位的问题是开放的。为了获得任何移位的目标成本,我们加强了输出基的属性,以及在算法过程中获得的属性:所有的基都以移位的Popov形式计算,其大小总是$\mathcal{O}(m σ)$。然后,我们设计了一个分治方案。我们递归地减少初始插值问题的子问题,更方便的移位,首先计算信息的程度的中间基地。
英文摘要:
We compute minimal bases of solutions for a general interpolation problem, which encompasses Hermite-Padé approximation and constrained multivariate interpolation, and has applications in coding theory and security. This problem asks to find univariate polynomial relations between $m$ vectors of size $σ$; these relations should have small degree with respect to an input degree shift. For an arbitrary shift, we propose an algorithm for the computation of an interpolation basis in shifted Popov normal form with a cost of $\mathcal{O}\tilde{~}(m^{ω-1} σ)$ field operations, where $ω$ is the exponent of matrix multiplication and the notation $\mathcal{O}\tilde{~}(\cdot)$ indicates that logarithmic terms are omitted. Earlier works, in the case of Hermite-Padé approximation and in the general interpolation case, compute non-normalized bases. Since for arbitrary shifts such bases may have size $Θ(m^2 σ)$, the cost bound $\mathcal{O}\tilde{~}(m^{ω-1} σ)$ was feasible only with restrictive assumptions on the shift that ensure small output sizes. The question of handling arbitrary shifts with the same complexity bound was left open. To obtain the target cost for any shift, we strengthen the properties of the output bases, and of those obtained during the course of the algorithm: all the bases are computed in shifted Popov form, whose size is always $\mathcal{O}(m σ)$. Then, we design a divide-and-conquer scheme. We recursively reduce the initial interpolation problem to sub-problems with more convenient shifts by first computing information on the degrees of the intermediate bases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。