arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.04842cs.DScs.NAmath.NAmath.OC
收藏

$Ax=b$的矩阵-向量复杂度

The matrix-vector complexity of $Ax=b$

University of Michigan(密歇根大学);UC Berkeley(加州大学伯克利分校);ICSI(国际计算机科学研究所)

Michał Dereziński, Ethan N. Epperly, Raphael A. Meyer

AI总结:

本文研究了求解线性方程组的矩阵-向量算法复杂度,证明了在最坏情况下所需矩阵-向量乘法次数的下界,验证了共轭梯度法的最优性。

摘要:

矩阵-向量算法,特别是Krylov子空间方法,普遍被视为解决大型线性方程组最有效的算法。本文建立了此类算法在最坏情况下所需矩阵-向量乘法次数的下界。第一个主要结果是,对于允许使用随机化并可进行矩阵及其转置乘法的任何矩阵-向量算法,解决一个条件数为$κ$的线性系统,以精度$\varepsilon$解决所需至少$Ω(κ\log(1/\varepsilon))$次矩阵-向量乘法,与共轭梯度法在正则方程中的上界相匹配。第二个主要结果是,单侧算法,即无法访问转置的算法,必须使用$n$次矩阵-向量乘法来解决一个$n \times n$的线性系统,即使问题完美条件。两个主要结果均包含明确的常数,这些常数与已知的上界相比,最多相差一个因子四。这些结果严格证明了矩阵-向量算法的局限性,并确认了广泛使用的Krylov子空间算法的最优性。

英文摘要:

Matrix--vector algorithms, particularly Krylov subspace methods, are widely viewed as the most effective algorithms for solving large systems of linear equations. This paper establishes lower bounds on the worst-case number of matrix--vector products needed by such an algorithm to approximately solve a general linear system. The first main result is that, for any matrix--vector algorithm which is allowed the use of randomization and can perform products with both a matrix and its transpose, $Ω(κ\log(1/\varepsilon))$ matrix--vector products are necessary to solve a linear system with condition number $κ$ to accuracy $\varepsilon$, matching an upper bound for conjugate gradient on the normal equations. The second main result is that one-sided algorithms, which lack access to the transpose, must use $n$ matrix--vector products to solve an $n \times n$ linear system, even when the problem is perfectly conditioned. Both main results include explicit constants that match known upper bounds up to a factor of four. These results rigorously demonstrate the limitations of matrix--vector algorithms and confirm the optimality of widely used Krylov subspace algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑