{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:42:18Z","timestamp":1740123738442,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T00:00:00Z","timestamp":1656547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T00:00:00Z","timestamp":1656547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["12101433"],"award-info":[{"award-number":["12101433"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s11075-022-01337-4","type":"journal-article","created":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T18:04:02Z","timestamp":1656612242000},"page":"1213-1231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0561-5787","authenticated-orcid":false,"given":"Chun","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian-Ying","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao-Li","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,30]]},"reference":[{"key":"1337_CR1","unstructured":"Page, L., Brin, S., Motwami, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web, Technical report, Computer Science Department, Stanford University, Stanford CA (1999)"},{"key":"1337_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A Langville","year":"2005","unstructured":"Langville, A., Meyer, C.: Deeper inside PageRank. Internet Math. 1, 335\u2013380 (2005)","journal-title":"Internet Math."},{"key":"1337_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(96)00238-8","volume":"259","author":"ZX Jia","year":"1997","unstructured":"Jia, Z.X.: Refined iterative algorithms based on Arnoldi\u2019s process for large unsymmetric eigenproblems. Linear Algebra Appl. 259, 1\u201323 (1997)","journal-title":"Linear Algebra Appl."},{"key":"1337_CR4","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-Arnoldi algorithm for computing pagerank. Numer. Linear Algebra Appl. 14, 521\u2013546 (2007)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1337_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.cam.2014.09.022","volume":"278","author":"CQ Gu","year":"2015","unstructured":"Gu, C.Q., Xie, F., Zhang, K.: A two-step matrix splitting iteration for computing pagerank. J. Comput. Appl. Math. 278, 19\u201328 (2015)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR6","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/080727397","volume":"32","author":"D Gleich","year":"2010","unstructured":"Gleich, D., Gray, A., Greif, C., Lau, T.: An inner-outer iteration for computing PageRank. SIAM J. Sci. Comput. 32, 349\u2013371 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1337_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.cam.2016.10.020","volume":"315","author":"C Wen","year":"2017","unstructured":"Wen, C., Huang, T.Z., Shen, Z.L.: A note on the two-step matrix splitting iteration for computing pagerank. J. Comput. Appl. Math. 315, 87\u201397 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.laa.2005.07.024","volume":"415","author":"R Morgan","year":"2006","unstructured":"Morgan, R., Zeng, M.: A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity. Linear Algebra Appl. 415, 96\u2013113 (2006)","journal-title":"Linear Algebra Appl."},{"key":"1337_CR9","doi-asserted-by":"publisher","first-page":"113034","DOI":"10.1016\/j.cam.2020.113034","volume":"381","author":"QY Hu","year":"2021","unstructured":"Hu, Q.Y., Wen, C., Huang, T.Z., Shen, Z.L., Gu, X.M.: A variant of the Power-Arnoldi algorithm for computing PageRank. J. Comput. Appl. Math. 381, 113034 (2021)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.cam.2016.08.034","volume":"313","author":"XY Tan","year":"2017","unstructured":"Tan, X.Y.: A new extrapolation method for pagerank computations. J. Comput. Appl. Math. 313, 383\u2013392 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cam.2018.03.017","volume":"343","author":"CQ Gu","year":"2018","unstructured":"Gu, C.Q., Jiang, X.L., Shao, C.C., Chen, Z.B.: A GMRES-power algorithm for computing PageRank problems. J. Comput. Appl. Math. 343, 113\u2013123 (2018)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR12","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/0907058","volume":"7","author":"Y Saad","year":"1986","unstructured":"Saad, Y., Schultz, M.H.: GMRES: A Generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7, 857\u2013869 (1986)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"1337_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.aml.2014.05.017","volume":"37","author":"BY Pu","year":"2014","unstructured":"Pu, B.Y., Huang, T.Z., Wen, C.: A preconditioned and extrapolation-accelerated GMRES method for PageRank. Appl. Math. Lett. 37, 95\u2013100 (2014)","journal-title":"Appl. Math. Lett."},{"key":"1337_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10543-006-0091-y","volume":"46","author":"GH Golub","year":"2006","unstructured":"Golub, G.H., Greif, C.: An Arnoldi-type algorithm for computing PageRank. BIT. 46, 759\u2013771 (2006)","journal-title":"BIT."},{"key":"1337_CR15","doi-asserted-by":"publisher","first-page":"3196","DOI":"10.1016\/j.cam.2010.02.009","volume":"234","author":"G Wu","year":"2010","unstructured":"Wu, G., Wei, Y.: An Arnoldi-Extrapolation algorithm for computing PageRank. J. Comput. Appl. Math. 234, 3196\u20133212 (2010)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR16","doi-asserted-by":"publisher","first-page":"112891","DOI":"10.1016\/j.cam.2020.112891","volume":"377","author":"QC Miao","year":"2020","unstructured":"Miao, Q.C., Tan, X.Y.: Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank. J. Comput. Appl. Math. 377, 112891 (2020)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR17","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s12190-013-0645-5","volume":"42","author":"CQ Gu","year":"2013","unstructured":"Gu, C.Q., Wang, L.: On the multi-splitting iteration method for computing pagerank. J. Appl. Math. Comput. 42, 479\u2013490 (2013)","journal-title":"J. Appl. Math. Comput."},{"key":"1337_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.cam.2016.05.026","volume":"309","author":"CQ Gu","year":"2017","unstructured":"Gu, C.Q., Wang, W.W.: An Arnoldi-Inout algorithm for computing PageRank problems. J. Comput. Appl. Math. 309, 219\u2013229 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR19","first-page":"87","volume":"338","author":"CQ Gu","year":"2018","unstructured":"Gu, C.Q., Jiang, X.L., Nie, Y., Chen, Z.B.: A preprocessed multi-step splitting iteration for computing PageRank. Appl. Math. Comput 338, 87\u2013100 (2018)","journal-title":"Appl. Math. Comput"},{"key":"1337_CR20","first-page":"479","volume":"356","author":"ZL Tian","year":"2019","unstructured":"Tian, Z.L., Liu, Y., Zhang, Y., Liu, Z.Y., Tian, M.Y.: The general inner-outer iteration method based on regular splittings for the PageRank problem. Appl. Math. Comput. 356, 479\u2013501 (2019)","journal-title":"Appl. Math. Comput."},{"key":"1337_CR21","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.cam.2018.07.015","volume":"346","author":"ZL Shen","year":"2019","unstructured":"Shen, Z.L., Huang, T.Z., Carpentieri, B., Wen, C., Gu, X.M., Tan, X.Y.: Off-diagonal low-rank preconditioner for difficult PageRank problems. J. Comput. Appl. Math. 346, 456\u2013470 (2019)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR22","first-page":"111","volume":"298","author":"ZL Shen","year":"2017","unstructured":"Shen, Z.L., Huang, T.Z., Carpentieri, B., Gu, X.M., Wen, C.: An efficient elimination strategy for solving Pagerank problems. Appl. Math. Comput. 298, 111\u2013122 (2017)","journal-title":"Appl. Math. Comput."},{"key":"1337_CR23","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.cam.2015.09.027","volume":"296","author":"HF Zhang","year":"2016","unstructured":"Zhang, H.F., Huang, T.Z., Wen, C., Shen, Z.L.: FOM accelerated by an extrapolation method for solving Pagerank problems. J. Comput. Appl. Math. 296, 397\u2013409 (2016)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR24","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1007\/s11075-021-01175-w","volume":"89","author":"XM Gu","year":"2021","unstructured":"Gu, X.M., Lei, S.L., Zhang, K., Shen, Z.L., Wen, C., Carpentieri, B.: A Hessenberg-type algorithm for computing PageRank Problems. Numer. Algorithms 89, 1845\u20131863 (2021)","journal-title":"Numer. Algorithms"},{"key":"1337_CR25","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/nla.789","volume":"19","author":"JF Yin","year":"2012","unstructured":"Yin, J.F., Yin, G.J., Ng, M.: On adaptively accelerated Arnoldi method for computing PageRank. Numer. Linear Algebra Appl. 19, 73\u201385 (2012)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1337_CR26","doi-asserted-by":"publisher","first-page":"113209","DOI":"10.1016\/j.cam.2020.113209","volume":"386","author":"C Wen","year":"2021","unstructured":"Wen, C., Hu, Q.Y., Yin, G.J., Gu, X.M., Shen, Z.L.: An adaptive Power-GArnoldi algorithm for computing PageRank. J. Comput. Appl. Math. 386, 113209 (2021)","journal-title":"J. Comput. Appl. Math."},{"key":"1337_CR27","unstructured":"Haveliwala, T., Kamvar, S.: The second eigenvalue of the google matrix. In: Proceedings of the Twelfth International World Wide Web of Conference (2003)"},{"key":"1337_CR28","doi-asserted-by":"crossref","unstructured":"Langville, A., Meyer, C.: Google\u2019s PageRank and beyond: The Science of the Search Engine Rankings. Princeton University Press (2006)","DOI":"10.1515\/9781400830329"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01337-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01337-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01337-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T08:33:01Z","timestamp":1673512381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01337-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,30]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1337"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01337-4","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2022,6,30]]},"assertion":[{"value":"24 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}