arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.10884math.NAcond-mat.dis-nncs.NA
收藏

幂迭代算法的简单指数加速

Simple exponential acceleration of the power iteration algorithm

Congzhou M Sha, Nikolay V Dokholyan

摘要:

许多现实世界的问题依赖于寻找矩阵的特征值和特征向量。幂迭代算法是求一般矩阵最大特征值及其特征向量的一种简单方法。该算法依赖于这样的思想,即随机选择的向量x与矩阵A的重复相乘逐渐放大沿着A的最大特征值的特征向量的向量的分量,同时抑制所有其他分量。不幸的是,幂迭代算法可能表现出缓慢的收敛。在这份报告中,我们证明了指数加速收敛的幂迭代算法,只有一个多项式的计算增加利用矩阵乘法的交换性。

英文摘要:

Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies on the idea that repeated multiplication of a randomly chosen vector x by the matrix A gradually amplifies the component of the vector along the eigenvector of the largest eigenvalue of A while suppressing all other components. Unfortunately, the power iteration algorithm may demonstrate slow convergence. In this report, we demonstrate an exponential speed up in convergence of the power iteration algorithm with only a polynomial increase in computation by taking advantage of the commutativity of matrix multiplication.

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

↑