超越多项式矩阵的二进制幂运算
Beating binary powering for polynomial matrices
AI总结:
本文提出一种计算多项式矩阵 N 次幂的纯线性复杂度算法,利用其元素满足与 N 无关的线性微分方程这一性质,在无 FFT 情况下也优于二进制幂运算,并推广到 C-有限序列和二元多项式模指数问题。
摘要:
固定大小和次数的多项式矩阵的 N 次幂可以通过二进制幂运算来计算,其速度与对 N 呈线性次数的两个多项式相乘一样快。当快速傅里叶变换(FFT)可用时,所得复杂度在 N 中是软线性的,即关于 N 是线性的,但带有额外的对数因子。我们证明,即使在缺少 FFT 的情况下,也有可能通过一种复杂度在 N 中为纯线性的算法来超越二进制幂运算。使这一改进成为可能的关键结果是:多项式矩阵的 N 次幂的各个元素满足多项式系数的线性微分方程,且这些方程的阶数和次数都与 N 无关。针对两个相关问题也提出了类似算法:计算 C-有限多项式序列的第 N 项,以及二元多项式模指数运算到 N 次幂。
英文摘要:
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is \emph{softly linear} in~$N$, i.e.~linear in~$N$ with extra logarithmic factors. We show that it is possible to beat binary powering, by an algorithm whose complexity is \emph{purely linear} in~$N$, even in absence of FFT. The key result making this improvement possible is that the entries of the $N$th power of a polynomial matrix satisfy linear differential equations with polynomial coefficients whose orders and degrees are independent of~$N$. Similar algorithms are proposed for two related problems: computing the $N$th term of a C-finite sequence of polynomials, and modular exponentiation to the power $N$ for bivariate polynomials.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。