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

外推Arnoldi算法提高特征向量收敛性

Extrapolating the Arnoldi Algorithm To Improve Eigenvector Convergence

Sara Pollock, L. Ridgway Scott

摘要:

我们考虑外推的Arnoldi算法,以加快计算的主导特征值/特征向量对。基本算法使用序列的Krylov向量,形成一个小的特征值问题,这是完全解决。从连续的Arnoldi步骤输出的两个主导特征向量,然后重新组合,以形成一个外推的ESTA,这个加速ESTA用于重新启动下一个Arnoldi过程。我们目前的数值结果测试的算法在各种情况下,并发现在大多数情况下,它大大提高了重新启动Arnoldi的性能。外推是一个简单的后处理步骤,具有最小的计算成本。

英文摘要:

We consider extrapolation of the Arnoldi algorithm to accelerate computation of the dominant eigenvalue/eigenvector pair. The basic algorithm uses sequences of Krylov vectors to form a small eigenproblem which is solved exactly. The two dominant eigenvectors output from consecutive Arnoldi steps are then recombined to form an extrapolated iterate, and this accelerated iterate is used to restart the next Arnoldi process. We present numerical results testing the algorithm on a variety of cases and find on most examples it substantially improves the performance of restarted Arnoldi. The extrapolation is a simple post-processing step which has minimal computational cost.

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

↑