{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:58:00Z","timestamp":1760245080610,"version":"3.41.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["10871051"],"award-info":[{"award-number":["10871051"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"National Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["08KJB110012"],"award-info":[{"award-number":["08KJB110012"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Xuzhou Normal University","award":["08XLY01"],"award-info":[{"award-number":["08XLY01"]}]},{"name":"Qing-Lan Project of Jiangsu Province","award":["QL200612"],"award-info":[{"award-number":["QL200612"]}]},{"name":"Shanghai Education Committee","award":["08SG01"],"award-info":[{"award-number":["08SG01"]}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["09DZ2272900"],"award-info":[{"award-number":["09DZ2272900"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p>PageRank is one of the most important ranking techniques used in today's search engines. A recent very interesting research track focuses on exploiting efficient numerical methods to speed up the computation of PageRank, among which the Arnoldi-type algorithm and the GMRES algorithm are competitive candidates. In essence, the former deals with the PageRank problem from an eigenproblem, while the latter from a linear system, point of view. However, there is little known about the relations between the two approaches for PageRank. In this article, we focus on a theoretical and numerical comparison of the two approaches. Numerical experiments illustrate the effectiveness of our theoretical results.<\/jats:p>","DOI":"10.1145\/1777432.1777434","type":"journal-article","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T13:02:22Z","timestamp":1277816542000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Arnoldi versus GMRES for computing pageRank"],"prefix":"10.1145","volume":"28","author":[{"given":"Gang","family":"Wu","sequence":"first","affiliation":[{"name":"Xuzhou Normal University"}]},{"given":"Yimin","family":"Wei","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai"}]}],"member":"320","published-online":{"date-parts":[[2010,7,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129125"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129098"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Berman A. and Plemmons R. 1994. Nonnegative Matrices in the Mathematical Sciences 2nd Ed. SIAM Philadelphia.  Berman A. and Plemmons R. 1994. Nonnegative Matrices in the Mathematical Sciences 2nd Ed. SIAM Philadelphia.","DOI":"10.1137\/1.9781611971262"},{"volume-title":"Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings. no. 07071","year":"2007","author":"Boldi P.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","first-page":"4","article-title":"The best of the 20th century: Editors name top 10 algorithms","volume":"33","author":"Cipra B.","year":"2000","journal-title":"SIAM News"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129108"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2006.10.080"},{"key":"e_1_2_1_8_1","unstructured":"Gleich D. Zhukov L. and Berkhin P. 2005. Fast parallel pagerank: A linear system approach. Yahoo&excl; Tech. Rep.  Gleich D. Zhukov L. and Berkhin P. 2005. Fast parallel pagerank: A linear system approach. Yahoo&excl; Tech. Rep."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-006-0091-y"},{"edition":"3","volume-title":"Matrix Computations","author":"Golub G.","key":"e_1_2_1_10_1"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02880075"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Langville A. and Meyer C. 2006. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press NJ.   Langville A. and Meyer C. 2006. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press NJ.","DOI":"10.1515\/9781400830329"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2008.06.003"},{"key":"e_1_2_1_14_1","unstructured":"MATLAB. 1994. MATLAB 7. The MATHWORKS INC.  MATLAB. 1994. MATLAB 7. The MATHWORKS INC."},{"key":"e_1_2_1_15_1","unstructured":"Moler C. 2002. The world's largest matrix computation. MATLAB News and Notes 12--13.  Moler C. 2002. The world's largest matrix computation. MATLAB News and Notes 12--13."},{"key":"e_1_2_1_16_1","unstructured":"Page L. Brin S. Motwami R. and Winograd T. 1998. The pagerank citation ranking: Bring order to the Web. Tech. rep. Computer Science Department Stanford University.  Page L. Brin S. Motwami R. and Winograd T. 1998. The pagerank citation ranking: Bring order to the Web. Tech. rep. Computer Science Department Stanford University."},{"volume-title":"Numerical Methods for Large Eigenvalue Problems. Algorithms and Architectures for Advanced Scientific Computing","author":"Saad Y.","key":"e_1_2_1_17_1"},{"edition":"2","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Saad Y.","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0907058"},{"volume-title":"Proceedings of the GAMM-SIAM Linear Algebra Conference.","year":"2006","author":"Schneider O.","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898348507"},{"volume-title":"Generalized Inverses: Theory and Computations","year":"2004","author":"Wang G.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/070698129"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.531"},{"key":"e_1_2_1_25_1","unstructured":"Wu G. and Wei Y. 2009a. Accelerated Arnoldi-type algorithms for computing stationary distribution with application to the pagerank and the generank problems. To appear.  Wu G. and Wei Y. 2009a. Accelerated Arnoldi-type algorithms for computing stationary distribution with application to the pagerank and the generank problems. To appear."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2010.02.009"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(02)00612-2"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30216-2_8"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1777432.1777434","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1777432.1777434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:25:52Z","timestamp":1750278352000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1777432.1777434"}},"subtitle":["A theoretical contribution to google's pageRank problem"],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["10.1145\/1777432.1777434"],"URL":"https:\/\/doi.org\/10.1145\/1777432.1777434","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"type":"print","value":"1046-8188"},{"type":"electronic","value":"1558-2868"}],"subject":[],"published":{"date-parts":[[2010,6]]},"assertion":[{"value":"2008-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}