For computing PageRank problems, a Power–Arnoldi algorithm is presented by periodically knitting the power method together with the thick restarted Arnoldi algorithm. In this paper, by using the power method with the extrapolation process based on trace (PET), a variant of the Power–Arnoldi algorithm is developed for accelerating PageRank computations. The new method is called Arnoldi-PET algorithm, whose implementation and convergence are analyzed. Numerical experiments on several examples are used to illustrate the effectiveness of our proposed algorithm.

中文翻译：

---

用于计算PageRank的Power–Arnoldi算法的一种变体

为了计算PageRank问题，通过定期编织幂方法与重新启动的厚Arnoldi算法一起提出了Power-Arnoldi算法。在本文中，通过将幂方法与基于轨迹的外推过程（PET）结合使用，开发了Power–Arnoldi算法的一种变体，用于加速PageRank计算。该新方法称为Arnoldi-PET算法，分析了其实现和收敛性。在几个例子上的数值实验用来说明我们提出的算法的有效性。