An Arnoldi-type algorithm for computing page rank

Author： Golub G. H.  

Publisher： Springer Publishing Company

ISSN： 0006-3835

Source： Bit Numerical Mathematics, Vol.46, Iss.4, 2006-12, pp. : 759-771

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

NewFriends: an algorithm for computing the minimum number of friends required by a user to get the highest PageRank in a social network

By Moreno Francisco   González Andrés   Valencia Andrés  

International Journal of Computer Mathematics, Vol. 91, Iss. 2, 2014-02 ,pp. : 278-290

Taylor & Francis Ltd

Access to resources Recommend Favorite

An invert-free Arnoldi method for computing interior eigenpairs of large matrices

By  

International Journal of Computer Mathematics, Vol. 84, Iss. 4, 2007-04 ,pp. : 477-490

Taylor & Francis Ltd

Access to resources Recommend Favorite

Access Log Analysis with PageRank

By  

ELECTRONICS & COMMUNICATIONS IN JAPAN, Vol. 98, Iss. 9, 2015-09 ,pp. : 23-30

John Wiley & Sons Inc

Access to resources Recommend Favorite

Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems

By Zhong Hong-xiu   Wu Gang  

International Journal of Computer Mathematics, Vol. 88, Iss. 5, 2011-03 ,pp. : 994-1012

Taylor & Francis Ltd

Access to resources Recommend Favorite

An inexact shift‐and‐invert Arnoldi algorithm for Toeplitz matrix exponential

By  

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol. 22, Iss. 4, 2015-08 ,pp. : 777-792

John Wiley & Sons Inc

Access to resources Recommend Favorite