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

特征问题的最小通信量与奇异值分解

Minimizing Communication for Eigenproblems and the Singular Value Decomposition

Grey Ballard, James Demmel, Ioana Dumitriu

摘要:

算法有两个成本:算术和通信。后者表示在存储器层次结构的级别之间或通过网络在处理器之间移动数据的成本。通信经常主导算术,并代表了总成本的比例迅速增加,所以我们寻求算法,最大限度地减少通信。在\cite{BDHS10}中,提出了基本上所有$O(n^3)$类线性代数算法所需的通信量的下界,包括本征值问题和SVD。传统的算法,包括目前在(Sca)LAPACK中实现的算法,执行比这些下界要求的渐近更多的通信。在本文中,我们提出了并行和顺序特征值算法(铅笔,非对称矩阵,和对称矩阵)和SVD算法,达到这些下界,并分析其收敛性和通信成本。

英文摘要:

Algorithms have two costs: arithmetic and communication. The latter represents the cost of moving data, either between levels of a memory hierarchy, or between processors over a network. Communication often dominates arithmetic and represents a rapidly increasing proportion of the total cost, so we seek algorithms that minimize communication. In \cite{BDHS10} lower bounds were presented on the amount of communication required for essentially all $O(n^3)$-like algorithms for linear algebra, including eigenvalue problems and the SVD. Conventional algorithms, including those currently implemented in (Sca)LAPACK, perform asymptotically more communication than these lower bounds require. In this paper we present parallel and sequential eigenvalue algorithms (for pencils, nonsymmetric matrices, and symmetric matrices) and SVD algorithms that do attain these lower bounds, and analyze their convergence and communication costs.

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

↑