2006Journal of Computer ApplicationsRequires access

Method of pagerank planar linear convergence

Cong Lei

Open publisher page 0 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: PageRank, Convergence (economics), Computer science, Power iteration, Eigenvalues and eigenvectors, Power (physics), Process (computing), Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Method of pagerank planar linear convergence — Research Paper | ScholarLens