arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2506.03466math.NAcs.CCcs.NA
收藏

缩减雅可比方法求解特征值和奇异值的算术和通信复杂度:第一部分--串行算法

Minimizing the Arithmetic and Communication Complexity of Jacobi's Method for Eigenvalues and Singular Values: Part One -- Serial Algorithms

University of California Berkeley(加州大学伯克利分校);Rice University(莱斯大学);University of Chicago(芝加哥大学)

James Demmel, Hengrui Luo, Ryan Schneider, Yifu Wang

AI总结:

本文研究了雅可比方法在对称特征值问题中的多种版本,旨在通过减少算术运算和通信开销来优化算法复杂度,分析了串行算法的复杂性界限及递归阻塞雅可比方法的优化效果。

摘要:

我们分析了对称特征值问题中几种雅可比方法的版本。我们的目标是尽可能减少算法的渐近成本,以算术运算次数和相关(串行或并行)通信(即数据在慢速和快速内存之间或处理器网络之间移动的量)来衡量。本文第一部分考虑了串行设置,本文提供了多种串行雅可比算法的严格复杂性界限,基于经典O(n^3)矩阵乘法和快速、类似Strassen的O(n^{ω_0})替代方法。在经典情况下,我们证明了雅可比方法的阻塞实现达到了O(n^3)矩阵乘法的通信下界(因此预计在O(n^3)的特征值求解器中是通信最优的)。在快速设置中,我们展示了递归阻塞雅可比方法可以进一步优化,达到两种度量的几乎最优复杂性。我们还推导了(单侧)雅可比SVD算法的类似复杂性界限。本文后续将扩展我们的复杂性分析到并行情况。

英文摘要:

We analyze several versions of Jacobi's method for the symmetric eigenvalue problem. Our goal is to reduce the asymptotic cost of the algorithm as much as possible, as measured by the number of arithmetic operations performed and associated (serial or parallel) communication, i.e., the amount of data moved between slow and fast memory or between processors in a network. The first half of this effort, which considers the serial setting, is presented here; this paper contains rigorous complexity bounds for a variety of serial Jacobi algorithms, built on both classic $O(n^3)$ matrix multiplication and fast, Strassen-like $O(n^{ω_0})$ alternatives. In the classical case, we show that a blocked implementation of Jacobi's method attains the communication lower bound for $O(n^3)$ matrix multiplication (and is therefore expected to be communication optimal among $O(n^3)$ eigensolvers). In the fast setting, we demonstrate that a recursive version of blocked Jacobi can go further, reaching essentially optimal complexity in both measures. We also derive analogous complexity bounds for (one-sided) Jacobi SVD algorithms. A forthcoming sequel to this paper will extend our complexity analysis to the parallel case.

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

↑