{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:20:20Z","timestamp":1725567620244},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642165146"},{"type":"electronic","value":"9783642165153"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16515-3_47","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T12:03:44Z","timestamp":1286971424000},"page":"378-385","source":"Crossref","is-referenced-by-count":1,"title":["On Arnoldi Method Accelerating PageRank Computations"],"prefix":"10.1007","author":[{"given":"Guo-Jian","family":"Yin","sequence":"first","affiliation":[]},{"given":"Jun-Feng","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1090\/qam\/42792","volume":"9","author":"W.E. Arnoldi","year":"1951","unstructured":"Arnoldi, W.E.: The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quart. Appl. Math.\u00a09, 17\u201329 (1951)","journal-title":"Quart. Appl. Math."},{"key":"47_CR2","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web, Standford Digital Libraries Working Paper (1998)"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P. Berkhin","year":"2005","unstructured":"Berkhin, P.: A survey on PageRank computing. Internet Mathematics\u00a02, 73\u2013120 (2005)","journal-title":"Internet Mathematics"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10543-006-0091-y","volume":"46","author":"G.H. Golub","year":"2006","unstructured":"Golub, G.H., Greif, C.: An Arnoldi-type algorithm for computing PageRank. BIT Numerical Mathematics\u00a046, 759\u2013771 (2006)","journal-title":"BIT Numerical Mathematics"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A.N. Langville","year":"2005","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Mathematics\u00a01, 335\u2013380 (2005)","journal-title":"Internet Mathematics"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.laa.2003.12.008","volume":"386","author":"S.D. Kamvar","year":"2004","unstructured":"Kamvar, S.D., Haveliwala, T.H., Golub, G.H.: Adaptive methods for the computation of PageRank. Linear Algebra Appl.\u00a0386, 51\u201365 (2004)","journal-title":"Linear Algebra Appl."},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Extrapolation methods for accelerating PageRank computations. In: Proceedings of the Twelfth International World Wide Web Conference (2003)","DOI":"10.1145\/775152.775190"},{"key":"47_CR8","unstructured":"Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Exploiting the block structure of the web for computing PageRank. Stanford University Technical Report, SCCM-03-02 (2003)"},{"key":"47_CR9","unstructured":"Haveliwala, T.H., Kamvar, S.D.: The second eigenvalue of the Google matrix. In: Proceedings of the Twelfth International World Wide Web Conference (2003)"},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1002\/nla.531","volume":"14","author":"G. Wu","year":"2007","unstructured":"Wu, G., Wei, Y.: A Power\u2013Arnoldi algorithm for computing PageRank. Numer. Linear Algebra Appl.\u00a014, 521\u2013546 (2007)","journal-title":"Numer. Linear Algebra Appl."},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895479894270427","volume":"17","author":"G.L.G. Sleijpen","year":"1996","unstructured":"Sleijpen, G.L.G., Van der Vorst, H.A.: A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Mat. Anal. Appl.\u00a017, 401\u2013425 (1996)","journal-title":"SIAM J. Mat. Anal. Appl."},{"key":"47_CR12","unstructured":"Bellalij, M., Saad, Y., Sadok, H.: On the convergence of the Arnoldi process for eigenvalue problems. Report umsi-2007-12, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN (2007)"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16515-3_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T15:48:04Z","timestamp":1553183284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16515-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642165146","9783642165153"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16515-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}