Method of pagerank planar linear convergence
Pagerank二维线性收敛方法

In Application, because of the huge number of web pages that even reach to several hundreds of million, it has to spend much time on computing pagerank by power method. So it needs some skills to make the convergence of power method fast. Based on the proof of power method, a method to accelerate the process of computing eigenvector was put forward when using revised power method to calculate the pagerank according to assumption of eigenvector being planar linear expressed. And the new method can shorten time expending meanwhile not increase any space storage. At last test data shows this method which comes from theory gets good convergence result in practice.