{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T08:16:49Z","timestamp":1690791409376},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T00:00:00Z","timestamp":1520380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11786-018-0335-7","type":"journal-article","created":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T04:28:54Z","timestamp":1520396934000},"page":"129-141","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["PageRank Computation with MAAOR and Lumping Methods"],"prefix":"10.1007","volume":"12","author":[{"given":"I. R.","family":"Mendes","sequence":"first","affiliation":[]},{"given":"P. B.","family":"Vasconcelos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,7]]},"reference":[{"issue":"18","key":"335_CR1","doi-asserted-by":"publisher","first-page":"3825","DOI":"10.1016\/j.comnet.2012.10.007","volume":"56","author":"S Brin","year":"2012","unstructured":"Brin, S., Page, L.: Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56(18), 3825\u20133833 (2012)","journal-title":"Comput. Netw."},{"issue":"2","key":"335_CR2","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/050626612","volume":"28","author":"C Brezinski","year":"2006","unstructured":"Brezinski, C., Redivo-Zaglia, M.: The PageRank vector: properties, computation, approximation, and acceleration. SIAM J. Matrix Anal. Appl. 28(2), 551\u2013575 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"335_CR3","doi-asserted-by":"crossref","unstructured":"Mendes, I., Vasconcelos, P.: Lumping method with acceleration for the PageRank computation. In: 2014 14th International Conference on Computational Science and Its Applications, Guimar\u00e3es. IEEE Conference Publications, pp. 221\u2013224 (2014)","DOI":"10.1109\/ICCSA.2014.50"},{"issue":"4","key":"335_CR4","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1137\/060664331","volume":"29","author":"I Ipsen","year":"2007","unstructured":"Ipsen, I., Selee, T.: PageRank computation, with special attention to dangling nodes. SIAM J. Matrix Anal. Appl. 29(4), 1281\u20131296 (2007)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"335_CR5","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.cam.2008.06.003","volume":"224","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Shee, X., Wei, Y.: On computing PageRank via lumping the Google matrix. J. Comput. Appl. Math. 224(2), 702\u2013708 (2009)","journal-title":"J. Comput. Appl. Math."},{"issue":"6","key":"335_CR6","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10791-012-9183-2","volume":"15","author":"O Yu","year":"2012","unstructured":"Yu, O., Miao, Z., Wu, G., Wei, Y.: Lumping algorithms for computing Google\u2019s PageRank and its derivative, with attention to unreferenced nodes. Inf. Retr. 15(6), 503\u2013526 (2012)","journal-title":"Inf. Retr."},{"key":"335_CR7","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/j.cam.2015.04.026","volume":"288","author":"A Hadjidimos","year":"2015","unstructured":"Hadjidimos, A.: The matrix analogue of the scalar AOR iterative method. J. Comput. Appl. Math. 288, 366\u2013378 (2015)","journal-title":"J. Comput. Appl. Math."},{"key":"335_CR8","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"A Langville","year":"2011","unstructured":"Langville, A., Meyer, C.: Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2011)"},{"key":"335_CR9","volume-title":"Matrix Computations","author":"G Golub","year":"2012","unstructured":"Golub, G., Van Loan, C.: Matrix Computations. JHU Press, Baltimore (2012)"},{"key":"335_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719512","volume-title":"Matrix Analysis and Applied Linear Algebra","author":"C Meyer","year":"2000","unstructured":"Meyer, C.: Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia (2000)"},{"key":"335_CR11","unstructured":"Arasu, A., Novak, J., Tomkins, A., Tomlin, J.: PageRank computation and the structure of the web: experiments and algorithms. In: Proceedings of the Eleventh International World Wide Web Conference, Poster Track, pp. 107\u2013117 (2002)"},{"issue":"3","key":"335_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1080\/15427951.2005.10129108","volume":"2","author":"G Corso Del","year":"2005","unstructured":"Del Corso, G., Gulli, A., Romani, F.: Fast PageRank computation via a sparse linear system. Internet Math. 2(3), 251\u2013273 (2005)","journal-title":"Internet Math."},{"key":"335_CR13","unstructured":"Gleich, D., Zhukov, L., Berkhin, P.: Fast parallel PageRank: a linear system approach. Yahoo! Research Technical Report YRL-2004-038, vol. 13 (2004)"},{"issue":"6","key":"335_CR14","doi-asserted-by":"publisher","first-page":"2112","DOI":"10.1137\/040607551","volume":"27","author":"A Langville","year":"2006","unstructured":"Langville, A., Meyer, C.: A reordering for the PageRank problem. SIAM J. Sci. Comput. 27(6), 2112\u20132120 (2006)","journal-title":"SIAM J. Sci. Comput."},{"key":"335_CR15","unstructured":"Del Corso, G., Gulli, A., Romani, F.: Exploiting Web Matrix Permutations to Speedup PageRank Computation. Technical Report IIT TR-04, Istituto di Informatica e Telematica (2004)"},{"issue":"141","key":"335_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1090\/S0025-5718-1978-0483340-6","volume":"32","author":"A Hadjidimos","year":"1978","unstructured":"Hadjidimos, A.: Accelerated overrelaxation method. Math. Comput. 32(141), 149\u2013157 (1978)","journal-title":"Math. Comput."},{"issue":"2","key":"335_CR17","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/0710042","volume":"10","author":"K James","year":"1973","unstructured":"James, K.: Convergence of matrix iterations subject to diagonal dominance. SIAM J. Numer. Anal. 10(2), 478\u2013484 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"335_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0024-3795(96)00028-6","volume":"256","author":"Y Song","year":"1997","unstructured":"Song, Y.: On the convergence of the generalized AOR method. Linear Algebra Appl. 256, 199\u2013218 (1997)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"335_CR19","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10957-014-0589-4","volume":"165","author":"A Hadjidimos","year":"2015","unstructured":"Hadjidimos, A., Tzoumas, M.: On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method. J. Optim. Theory Appl. 165(2), 545\u2013562 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"335_CR20","doi-asserted-by":"publisher","first-page":"A2558","DOI":"10.1137\/110834585","volume":"34","author":"G Wu","year":"2012","unstructured":"Wu, G., Wang, Y.C., Jin, X.Q.: A preconditioned and shifted GMRES algorithm for the PageRank problem with multiple damping factors. SIAM J. Sci. Comput. 34(5), A2558\u2013A2575 (2012)","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-018-0335-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-018-0335-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-018-0335-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T00:11:38Z","timestamp":1551917498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-018-0335-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,7]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["335"],"URL":"https:\/\/doi.org\/10.1007\/s11786-018-0335-7","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,7]]},"assertion":[{"value":"28 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}