具有位移结构的矩阵:用于线性系统和空域基的确定性方法
Matrices with displacement structure: a deterministic approach for linear systems and nullspace bases
AI总结:
本文提出了一种确定性的快速方法,用于求解具有位移结构的线性系统和空域基,适用于任意矩形矩阵。
摘要:
目前处理结构矩阵(以位移秩度量意义)的最快已知算法是随机化的。对于处理经典位移结构,它们实现了求解线性系统的时间复杂度为~O(α^{ω-1} n),计算空域的时间复杂度为~O(α^2 n)。这里n×n是正方形矩阵的大小,α是其位移秩,ω>2是矩阵乘法的可行指数,~O(·)表示在基域中计算算术运算时隐藏了对数因子。这些算法依赖于将Strassen的分治法高斯消去法适应到结构矩阵的上下文中。这种方法要求输入矩阵具有通用的秩剖面;这一约束通过预乘和后乘特殊矩阵来解除,这些矩阵由在足够大的基域子集中随机选择的系数生成。本研究介绍了一种快速且确定性的方法,能够在任意矩形m×n输入矩阵上以~O(α^{ω-1}(m+n))的时间复杂度在基域中完成这两个问题。我们提供了具体的算法,将该方法应用于Toeplitz-like、Vandermonde-like和Cauchy-like结构。该方法的起点是将结构线性系统重新表述为单变量多项式的模方程。然后通过三个步骤找到该方程的所有解,所有步骤都使用快速且确定性的多项式矩阵操作。具体来说,首先计算向量M-Padé逼近问题的解基;然后在多项式上进行线性系统求解以分离不需要的未知数并限制到实际寻求的未知数;最后通过同时M-Padé逼近找到后者。
英文摘要:
For matrices with a displacement structure, the fastest known algorithms for solving linear systems and computing nullspace bases are randomized, with respective costs of $\tilde{O}(α^{ω-1} n)$ and $\tilde{O}(α^2 n)$ operations in the base field. Here $n \times n$ is the matrix size, $α$ is its displacement rank, $ω> 2$ is a feasible exponent for matrix multiplication, and $\tilde{O}(\cdot)$ hides logarithmic factors. For a long time, such structured solvers were also the fastest known method to perform Hermite-Padé or simultaneous Padé approximations, and their interpolation variants, until recently when these problems received efficient and deterministic solutions via polynomial matrix algorithms. This work proposes to take the converse direction, by showing that these recent polynomial matrix tools can be used to improve structured matrix computations. We present a new approach which, for the Toeplitz-like, Vandermonde-like, and Cauchy-like structures, solves linear systems and computes nullspace bases in $\tilde{O}(α^{ω-1}(m+n))$ operations for an arbitrary $m \times n$ matrix, deterministically and with no assumption on the base field. This bound matches the best known randomized one for linear systems and improves upon it for nullspaces. The approach reformulates the problem as a modular equation on univariate polynomials, and describes all its solutions in three steps: computing a basis of solutions to a vector M-Padé approximation problem, solving a polynomial matrix equation to get rid of unwanted unknowns, and finding the sought unknowns via simultaneous M-Padé approximation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。