{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:40:30Z","timestamp":1740123630338,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Scientific Research Project of the Guizhou Provincial Education","award":["KY[2022]126"],"award-info":[{"award-number":["KY[2022]126"]}]},{"name":"Sichuan Science and Technology Program","award":["2022ZYD0006"],"award-info":[{"award-number":["2022ZYD0006"]}]},{"name":"Guanghua Talent Project of Southwestern University of Finance and Economics","award":["20170224"],"award-info":[{"award-number":["20170224"]}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202206985005"],"award-info":[{"award-number":["202206985005"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s11227-024-06327-y","type":"journal-article","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T18:04:27Z","timestamp":1719857067000},"page":"22836-22859","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Application of an extrapolation method in the Hessenberg algorithm for computing PageRank"],"prefix":"10.1007","volume":"80","author":[{"given":"Qian-Ying","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian-Ming","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,1]]},"reference":[{"key":"6327_CR1","unstructured":"Page L, Brin S, Motwani R, Winograd T, et al. (1999) The PageRank citation ranking: Bringing order to the web. Stanford InfoLab, Stanford University, Stanford, CA, 17 pages. Available online at http:\/\/ilpubs.stanford.edu:8090\/422\/"},{"key":"6327_CR2","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1142\/S0219622018500402","volume":"17","author":"J Kapusta","year":"2018","unstructured":"Kapusta J, Munk M, Drlik M (2018) Website structure improvement based on the combination of selected web usage mining methods. Int J Inf Technol Decis Mak 17:1743\u20131776. https:\/\/doi.org\/10.1142\/S0219622018500402","journal-title":"Int J Inf Technol Decis Mak"},{"issue":"1","key":"6327_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/S0036144503424786","volume":"47","author":"AN Langville","year":"2005","unstructured":"Langville AN, Meyer CD (2005) A survey of eigenvector methods for web information retrieval. SIAM Rev 47(1):135\u2013161. https:\/\/doi.org\/10.1137\/S0036144503424786","journal-title":"SIAM Rev"},{"issue":"3","key":"6327_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"AN Langville","year":"2004","unstructured":"Langville AN, Meyer CD (2004) Deeper inside PageRank. Internet Math 1(3):335\u2013380","journal-title":"Internet Math"},{"issue":"1","key":"6327_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P Berkhin","year":"2005","unstructured":"Berkhin P (2005) A survey on PageRank computing. Internet Math 2(1):73\u2013120","journal-title":"Internet Math"},{"key":"6327_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02985759","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"AN Langville","year":"2006","unstructured":"Langville AN, Meyer CD (2006) Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton, NJ. https:\/\/doi.org\/10.1007\/BF02985759"},{"key":"6327_CR7","doi-asserted-by":"publisher","first-page":"3140","DOI":"10.1016\/j.cam.2010.02.005","volume":"11","author":"A Cicone","year":"2010","unstructured":"Cicone A, Serra-Capizzano S (2010) Google PageRanking problem: The model and the analysis. J. Comput. Appl. Math. 11:3140\u20133169. https:\/\/doi.org\/10.1016\/j.cam.2010.02.005","journal-title":"J. Comput. Appl. Math."},{"key":"6327_CR8","unstructured":"Haveliwala T, Kamvar S, Klein D, Manning C, Golub G (2003) Computing PageRank using power extrapolation. Informe t\u00e9cnico. Available online at http:\/\/ilpubs.stanford.edu:8090\/605\/"},{"key":"6327_CR9","doi-asserted-by":"publisher","unstructured":"Kamvar S, Haveliwala T, Klein D, Manning C, Golub G (2003) Extrapolation methods for accelerating PageRank computations. In: Proceedings of the 12th International World Wide Web Conference (WWW\u201903), pp. 261\u2013270. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/775152.775190","DOI":"10.1145\/775152.775190"},{"key":"6327_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.aml.2014.05.017","volume":"37","author":"B-Y Pu","year":"2014","unstructured":"Pu B-Y, Huang T-Z, Wen C (2014) A preconditioned and extrapolation accelerated GMRES method for PageRank. Appl Math Lett 37:95\u2013100. https:\/\/doi.org\/10.1016\/j.aml.2014.05.017","journal-title":"Appl Math Lett"},{"key":"6327_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.cam.2016.08.034","volume":"313","author":"X-Y Tan","year":"2017","unstructured":"Tan X-Y (2017) A new extrapolation method for PageRank computations. J Comput Appl Math 313:383\u2013392. https:\/\/doi.org\/10.1016\/j.cam.2016.08.034","journal-title":"J Comput Appl Math"},{"issue":"2","key":"6327_CR12","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/050626612","volume":"28","author":"C Brezinski","year":"2006","unstructured":"Brezinski C, Redivo-Zaglia M (2006) The PageRank vector: properties, computation, approximation, and acceleration. SIAM J Matrix Anal Appl 28(2):551\u2013575. https:\/\/doi.org\/10.1137\/050626612","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"6327_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.camwa.2007.11.027","volume":"56","author":"A Sidi","year":"2008","unstructured":"Sidi A (2008) Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations. Comput Math Appl 56(1):1\u201324. https:\/\/doi.org\/10.1016\/j.camwa.2007.11.027","journal-title":"Comput Math Appl"},{"key":"6327_CR14","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 (2017) A note on the two-step matrix splitting iteration for computing PageRank. J Comput Appl Math 315:87\u201397. https:\/\/doi.org\/10.1016\/j.cam.2016.10.020","journal-title":"J Comput Appl Math"},{"key":"6327_CR15","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s12190-013-0645-5","volume":"42","author":"C-Q Gu","year":"2013","unstructured":"Gu C-Q, Wang L (2013) On the multi-splitting iteration method for computing PageRank. J Appl Math Comput 42:479\u2013490. https:\/\/doi.org\/10.1007\/s12190-013-0645-5","journal-title":"J Appl Math Comput"},{"key":"6327_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.cam.2016.10.020","volume":"278","author":"C-Q Gu","year":"2015","unstructured":"Gu C-Q, Xie F, Zhang K (2015) A two-step matrix splitting iteration for computing PageRank. J Comput Appl Math 278:19\u201328. https:\/\/doi.org\/10.1016\/j.cam.2016.10.020","journal-title":"J Comput Appl Math"},{"issue":"4","key":"6327_CR17","doi-asserted-by":"publisher","first-page":"855","DOI":"10.3934\/naco.2012.2.855","volume":"2","author":"Z-Z Bai","year":"2012","unstructured":"Bai Z-Z (2012) On convergence of the inner-outer iteration method for computing PageRank. Numer Algebra Control Optim 2(4):855\u2013862. https:\/\/doi.org\/10.3934\/naco.2012.2.855","journal-title":"Numer Algebra Control Optim"},{"key":"6327_CR18","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.amc.2019.02.066","volume":"356","author":"Z-L Tian","year":"2019","unstructured":"Tian Z-L, Liu Y, Zhang Y, Liu Z-Y, Tian M-Y (2019) The general inner-outer iteration method based on regular splittings for the PageRank problem. Appl Math Comput 356:479\u2013501. https:\/\/doi.org\/10.1016\/j.amc.2019.02.066","journal-title":"Appl Math Comput"},{"key":"6327_CR19","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1007\/s11075-022-01337-4","volume":"92","author":"C Wen","year":"2023","unstructured":"Wen C, Hu Q-Y, Shen Z-L (2023) An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank. Numer Algorithms 92:1213\u20131231. https:\/\/doi.org\/10.1007\/s11075-022-01337-4","journal-title":"Numer Algorithms"},{"issue":"1","key":"6327_CR20","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/080727397","volume":"32","author":"DF Gleich","year":"2010","unstructured":"Gleich DF, Gray AP, Greif C, Lau T (2010) An inner-outer iteration for computing PageRank. SIAM J Sci Comput 32(1):349\u2013371. https:\/\/doi.org\/10.1137\/080727397","journal-title":"SIAM J Sci Comput"},{"key":"6327_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.laa.2003.12.008","volume":"386","author":"S Kamvar","year":"2004","unstructured":"Kamvar S, Haveliwala T, Golub G (2004) Adaptive methods for the computation of PageRank. Linear Algebra Appl 386:51\u201365. https:\/\/doi.org\/10.1016\/j.laa.2003.12.008","journal-title":"Linear Algebra Appl"},{"issue":"4","key":"6327_CR22","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1137\/060664331","volume":"29","author":"IC Ipsen","year":"2007","unstructured":"Ipsen IC, Selee TM (2007) PageRank computation, with special attention to dangling nodes. SIAM J Matrix Anal Appl 29(4):1281\u20131296. https:\/\/doi.org\/10.1137\/060664331","journal-title":"SIAM J Matrix Anal Appl"},{"key":"6327_CR23","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.cam.2008.06.003","volume":"224","author":"Y-Q Lin","year":"2009","unstructured":"Lin Y-Q, Shi X-H, Wei Y-M (2009) On computing PageRank via lumping the Google matrix. J Comput Appl Math 224:702\u2013708. https:\/\/doi.org\/10.1016\/j.cam.2008.06.003","journal-title":"J Comput Appl Math"},{"key":"6327_CR24","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10791-012-9183-2","volume":"15","author":"Q Yu","year":"2012","unstructured":"Yu Q, Miao Z-K, Wu G, Wei Y-M (2012) Lumping algorithms for computing Google\u2019s PageRank and its derivative with attention to unreferenced nodes. Inf Retr 15:503\u2013526. https:\/\/doi.org\/10.1007\/s10791-012-9183-2","journal-title":"Inf Retr"},{"key":"6327_CR25","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/050643799","volume":"45","author":"K Avrachenkov","year":"2017","unstructured":"Avrachenkov K, Litvak N, Nemirovsky D, Osipova N (2017) Monte Carlo methods in PageRank computation: when one iteration is sufficient. SIAM J Numer Anal 45:890\u2013904","journal-title":"SIAM J Numer Anal"},{"key":"6327_CR26","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10115-013-0691-1","volume":"42","author":"W Liu","year":"2015","unstructured":"Liu W, Li G, Cheng J (2015) Fast PageRank approximation by adaptive sampling. Knowl Inf Syst 42:127\u2013146","journal-title":"Knowl Inf Syst"},{"key":"6327_CR27","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10543-006-0091-y","volume":"46","author":"GH Golub","year":"2006","unstructured":"Golub GH, Greif C (2006) An Arnoldi-type algorithm for computing PageRank. BIT 46:759\u2013771","journal-title":"BIT"},{"key":"6327_CR28","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-M (2010) An Arnoldi-Extrapolation algorithm for computing PageRank. J Comput Appl Math 234:3196\u20133212. https:\/\/doi.org\/10.1016\/j.cam.2010.02.009","journal-title":"J Comput Appl Math"},{"key":"6327_CR29","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1002\/nla.531","volume":"14","author":"G Wu","year":"2007","unstructured":"Wu G, Wei Y-M (2007) A Power-Arnoldi algorithm for computing PageRank. Numer Linear Algebra Appl 14:521\u2013546. https:\/\/doi.org\/10.1002\/nla.531","journal-title":"Numer Linear Algebra Appl"},{"key":"6327_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2020.113034","volume":"381","author":"Q-Y Hu","year":"2021","unstructured":"Hu Q-Y, Wen C, Huang T-Z, Shen Z-L, Gu X-M (2021) A variant of the Power-Arnoldi algorithm for computing PageRank. J Comput Appl Math 381:113034. https:\/\/doi.org\/10.1016\/j.cam.2020.113034","journal-title":"J Comput Appl Math"},{"key":"6327_CR31","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/nla.789","volume":"19","author":"J-F Yin","year":"2012","unstructured":"Yin J-F, Yin G-J, Ng M (2012) On adaptively accelerated Arnoldi method for computing PageRank. Numer Linear Algebra Appl 19:73\u201385. https:\/\/doi.org\/10.1002\/nla.789","journal-title":"Numer Linear Algebra Appl"},{"key":"6327_CR32","doi-asserted-by":"publisher","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 (2021) An adaptive Power-GArnoldi algorithm for computing PageRank. J Comput Appl Math 386:113209. https:\/\/doi.org\/10.1016\/j.cam.2020.113209","journal-title":"J Comput Appl Math"},{"key":"6327_CR33","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cam.2018.03.017","volume":"343","author":"C-Q Gu","year":"2018","unstructured":"Gu C-Q, Jiang X-L, Shao C-C, Chen Z-B (2018) A GMRES-Power algorithm for computing PageRank problems. J Comput Appl Math 343:113\u2013123. https:\/\/doi.org\/10.1016\/j.cam.2018.03.017","journal-title":"J Comput Appl Math"},{"key":"6327_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2021.126799","volume":"420","author":"Z-L Shen","year":"2022","unstructured":"Shen Z-L, Su M, Carpentieri B, Wen C (2022) Shifted power-GMRES method accelerated by extrapolation for solving PageRank with multiple damping factors. Appl Math Comput 420:126799. https:\/\/doi.org\/10.1016\/j.amc.2021.126799","journal-title":"Appl Math Comput"},{"key":"6327_CR35","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1007\/s11075-021-01175-w","volume":"89","author":"X-M Gu","year":"2022","unstructured":"Gu X-M, Lei S-L, Zhang K, Shen Z-L, Wen C, Carpentieri B (2022) A Hessenberg-type algorithm for computing PageRank problems. Numer Algorithms 89:1845\u20131863. https:\/\/doi.org\/10.1007\/s11075-021-01175-w","journal-title":"Numer Algorithms"},{"key":"6327_CR36","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1093\/qjmam\/4.4.466","volume":"9","author":"WE Arnoldi","year":"1951","unstructured":"Arnoldi WE (1951) The principle of minimized iteration in the solution of the matrix eigenvalue problem. Q Appl Math 9:17\u201329. https:\/\/doi.org\/10.1093\/qjmam\/4.4.466","journal-title":"Q Appl Math"},{"key":"6327_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114395","volume":"413","author":"Y Jin","year":"2022","unstructured":"Jin Y, Wen C, Huang T-Z, Shen Z-L (2022) A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank. J Comput Appl Math 413:114395. https:\/\/doi.org\/10.1016\/j.cam.2022.114395","journal-title":"J Comput Appl Math"},{"key":"6327_CR38","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.cam.2016.05.026","volume":"309","author":"C-Q Gu","year":"2017","unstructured":"Gu C-Q, Wang W-W (2017) An Arnoldi-Inout algorithm for computing PageRank problems. J Comput Appl Math 309:219\u2013229. https:\/\/doi.org\/10.1016\/j.cam.2016.05.026","journal-title":"J Comput Appl Math"},{"key":"6327_CR39","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.cam.2015.09.027","volume":"296","author":"H-F Zhang","year":"2016","unstructured":"Zhang H-F, Huang T-Z, Wen C, Shen Z-L (2016) FOM accelerated by an extrapolation method for solving PageRank problems. J Comput Appl Math 296:397\u2013409. https:\/\/doi.org\/10.1016\/j.cam.2015.09.027","journal-title":"J Comput Appl Math"},{"key":"6327_CR40","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1137\/S0895479898334605","volume":"22","author":"K Wu","year":"2000","unstructured":"Wu K, Simon H (2000) Thick-restart Lanczos method for large symmetric eigenvalue problems. SIAM J Matrix Anal Appl 22:602\u2013616. https:\/\/doi.org\/10.1137\/S0895479898334605","journal-title":"SIAM J Matrix Anal Appl"},{"key":"6327_CR41","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/0613025","volume":"13","author":"D Sorensen","year":"1993","unstructured":"Sorensen D (1993) Implicit application of polynomial filters in a $$k$$-step Arnoldi method. SIAM J Matrix Anal Appl 13:357\u2013385. https:\/\/doi.org\/10.1137\/0613025","journal-title":"SIAM J Matrix Anal Appl"},{"key":"6327_CR42","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cam.2015.09.014","volume":"296","author":"R Astudillo","year":"2016","unstructured":"Astudillo R, Gijzen MB (2016) A restarted Induced Dimension Reduction method to approximate eigenpairs of large unsymmetric matrices. J Comput Appl Math 296:24\u201335. https:\/\/doi.org\/10.1016\/j.cam.2015.09.014","journal-title":"J Comput Appl Math"},{"key":"6327_CR43","doi-asserted-by":"publisher","unstructured":"Langville AN, Meyer CD (2004) Updating PageRank with iterative aggregation. In: Proceedings of the 13th International World Wide Web Conference on Alternate Track Papers & Posters (WWW Alt.\u201904), pp. 392\u2013393. ACM, New York, NY. https:\/\/doi.org\/10.1145\/1013367.1013491","DOI":"10.1145\/1013367.1013491"},{"key":"6327_CR44","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/070711487","volume":"48","author":"M Bellalij","year":"2010","unstructured":"Bellalij M, Saad Y, Sadok H (2010) Further analysis of the Arnoldi process for eigenvalue problems. SIAM J Numer Anal 48:393\u2013407. https:\/\/doi.org\/10.1137\/070711487","journal-title":"SIAM J Numer Anal"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06327-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06327-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06327-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T09:22:06Z","timestamp":1723454526000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06327-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,1]]},"references-count":44,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["6327"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06327-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2024,7,1]]},"assertion":[{"value":"22 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2024","order":2,"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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}