%0 Journal Article
%T Method of pagerank planar linear convergence<br>Pagerank二维线性收敛方法
%A XU Nan-shan
%A CONG Lei
%A <br>丛磊
%J 计算机应用
%D 2006
%I 
%X 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.
%K search engine
%K pagerank
%K power method
%K eigenvector
%K convergence<br>搜索引擎
%K 网页排名
%K 幂法
%K 特征向量
%K 收敛
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=4D3DA0D9B3AB340B&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=BE34987501BA69F7&eid=656BC79BFC7F0F4B&journal_id=1001-9081&journal_name=计算机应用&referenced_num=1&reference_num=6