{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T17:34:41Z","timestamp":1722706481759},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T00:00:00Z","timestamp":1630368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T00:00:00Z","timestamp":1630368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071335"],"award-info":[{"award-number":["12071335"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11075-021-01166-x","type":"journal-article","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T09:03:51Z","timestamp":1630400631000},"page":"1603-1637","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The coupled iteration algorithms for computing PageRank"],"prefix":"10.1007","volume":"89","author":[{"given":"Zhaolu","family":"Tian","sequence":"first","affiliation":[]},{"given":"Zhongyun","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yinghui","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"key":"1166_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 (1998)"},{"key":"1166_CR2","doi-asserted-by":"crossref","unstructured":"Boldi, P., Santini, M., Vigna, S.: PageRank as a function of the damping factor. In: Proceedings of the 14th International World Web Conference. ACM, New York (2005)","DOI":"10.1145\/1060745.1060827"},{"key":"1166_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s40314-016-0338-4","volume":"37","author":"YJ Xie","year":"2018","unstructured":"Xie, Y.J., Ma, C.F.: A relaxed two-step splitting iteration method for computing PageRank. Comp. Appl. Math. 37, 221\u2013233 (2018)","journal-title":"Comp. Appl. Math."},{"key":"1166_CR4","unstructured":"Arasu, A., Novak, J., Tomkins, A., Tomlin, J.: PageRank computation and the structure of the web: experiments and algorithms. In: Proceedings of 11th International World Web Conference, Honolulu (2002)"},{"key":"1166_CR5","first-page":"337","volume":"271","author":"ZL Tian","year":"2018","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. 271, 337\u2013343 (2018)","journal-title":"Appl. Math. Comput."},{"key":"1166_CR6","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":"1166_CR7","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":"1166_CR8","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/1052934.1052938","volume":"5","author":"M Bianchini","year":"2005","unstructured":"Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. Internet Technol. 5, 92\u2013128 (2005)","journal-title":"ACM Trans. Internet Technol."},{"key":"1166_CR9","first-page":"337","volume":"271","author":"N Huang","year":"2015","unstructured":"Huang, N., Ma, C.F.: Parallel multisplitting iteration methods based on M-splitting for the PageRank problem. Appl. Math. Comput. 271, 337\u2013343 (2015)","journal-title":"Appl. Math. Comput."},{"key":"1166_CR10","doi-asserted-by":"crossref","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Extrapolation methods for accelerating PageRank computations. In: Proceedings of the 12th International World Web Conference. pp. 261\u2013270, ACM, New York (2003)","DOI":"10.1145\/775152.775190"},{"key":"1166_CR11","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":"1166_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1090\/S0025-5718-1978-0483340-6","volume":"32","author":"A Hadjimos","year":"1978","unstructured":"Hadjimos, A.: Accelerated overrelaxation method. Math. Comp. 32, 149\u2013157 (1978)","journal-title":"Math. Comp."},{"key":"1166_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0377-0427(97)00008-3","volume":"79","author":"YZ Song","year":"1997","unstructured":"Song, Y.Z.: On the convergence of the MAOR method. J. Comput. Appl. Math. 79, 299\u2013317 (1997)","journal-title":"J. Comput. Appl. Math."},{"key":"1166_CR14","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":"1166_CR15","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830329","volume-title":"Beyond The Science of Search Engine Rankings","author":"AN Langville","year":"2006","unstructured":"Langville, A.N., Meyer, C.D., PageRank, Googles: Beyond The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)"},{"key":"1166_CR16","first-page":"330","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn., pp 330\u2013332. The Johns Hopkins University Press, Baltimore (1996)","edition":"3rd edn."},{"key":"1166_CR17","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, 551\u2013575 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1166_CR18","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":"1166_CR19","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., 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":"1166_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-05156-2","volume-title":"Matrix Iterative Analysis","author":"RS Varga","year":"2000","unstructured":"Varga, R.S.: Matrix Iterative Analysis, pp 63\u2013143. Springer, Berlin Heidelberg (2000)"},{"key":"1166_CR21","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 Math. 2, 73\u2013120 (2005)","journal-title":"Internet Math."},{"key":"1166_CR22","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":"1166_CR23","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A Langville","year":"2004","unstructured":"Langville, A., Meyer, C.: Deeper inside PageRank. Internet Math. 1, 335\u2013380 (2004)","journal-title":"Internet Math."},{"key":"1166_CR24","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/080727397","volume":"32","author":"DF Gleich","year":"2010","unstructured":"Gleich, D.F., Gray, A.P., Greif, C., Lau, T.: An inner-outer iteration method for computing PageRank. SIAM J. Sci. Comput. 32, 349\u2013371 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1166_CR25","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s40314-019-0830-8","volume":"38","author":"MY Tian","year":"2019","unstructured":"Tian, M.Y., Zhang, Y., Wang, Y.D., Tian, Z.L.: A general multi-splitting iteration method for computing PageRank. Comp. Appl. Math. 38, 60 (2019). https:\/\/doi.org\/10.1007\/s40314-019-0830-8","journal-title":"Comp. Appl. Math."},{"key":"1166_CR26","volume-title":"Nonnegative matrices in the mathematical sciences","author":"A Berman","year":"1979","unstructured":"Berman, A., Plemmons, R.J.: Nonnegative matrices in the mathematical sciences. Academic Press, NewYork (1979)"},{"key":"1166_CR27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971446","volume-title":"Applied numerical linear algebra","author":"JW Demmel","year":"1997","unstructured":"Demmel, J.W.: Applied numerical linear algebra. Society for Industrial and Applied Mathematics, Philadelphia (1997)"},{"key":"1166_CR28","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.: A Power-Arnoldi algorithm for computing pagerank. Numer. Linear Algebra Appl. 14, 521\u2013546 (2007)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1166_CR29","first-page":"1","volume":"000","author":"H Migall\u00f3n","year":"2016","unstructured":"Migall\u00f3n, H., Migall\u00f3n, V., Palomino, J.A., Penad\u00e9s, J.: A heuristic relaxed extrapolated algorithm for accelerating PageRank. Adv. Eng. Softw. 000, 1\u20138 (2016)","journal-title":"Adv. Eng. Softw."},{"key":"1166_CR30","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.advengsoft.2018.03.002","volume":"25","author":"H Migall\u00f3n","year":"2018","unstructured":"Migall\u00f3n, H., Migall\u00f3n, V., Penad\u00e9s, J.: Parallel two-stage algorithms for solving the PageRank problem. Adv. Eng. Softw. 25, 188\u2013199 (2018)","journal-title":"Adv. Eng. Softw."},{"key":"1166_CR31","first-page":"63","volume":"292","author":"ZL Tian","year":"2017","unstructured":"Tian, Z.L., Tian, M.Y., Liu, Z.Y., Xu, T.Y.: The Jacobi and Gauss-Seidel-type iteration methods for the matrix equation AXB = C. Appl. Math. Comput. 292, 63\u201375 (2017)","journal-title":"Appl. Math. Comput."},{"key":"1166_CR32","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative methods for sparse linear systems. Soc. Ind. Appl. Math. US (2000)","DOI":"10.1016\/S1570-579X(01)80025-2"},{"key":"1166_CR33","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.laa.2003.12.008","volume":"386","author":"SD Kamvar","year":"2004","unstructured":"Kamvar, S.D., Haveliwala, T.H., Golub, G.: Adaptive methods for the computation of PageRank. Linear Algebra Appl. 386, 51\u201365 (2004)","journal-title":"Linear Algebra Appl."},{"key":"1166_CR34","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.: An Arnoldi-extrapolation algorithm for computing PageRank. J. Comput. Appl. Math. 234, 3196\u20133212 (2010)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1166_CR35","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s10543-015-0571-z","volume":"56","author":"PN Njeru","year":"2016","unstructured":"Njeru, P.N., Guo, X.P.: Accelerated SOR-like method for augmented linear systems. BIT Numer. Math. 56(2), 557\u2013571 (2016)","journal-title":"BIT Numer. Math."},{"key":"1166_CR36","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1049\/iet-cta.2018.5151","volume":"13","author":"WX Zhang","year":"2019","unstructured":"Zhang, W.X., Zhou, D.: Coupled iterative algorithms based on optimisation for solving Sylvester matrix equations. IET Control Theory Appl. 13, 584\u2013593 (2019)","journal-title":"IET Control Theory Appl."},{"key":"1166_CR37","doi-asserted-by":"publisher","first-page":"3206","DOI":"10.1016\/j.physleta.2010.06.007","volume":"374","author":"DL Shepelyansky","year":"2010","unstructured":"Shepelyansky, D.L., Zhirov, D.V.: Towards Google matrix of brain. Phys. Lett. A. 374, 3206\u20133209 (2010)","journal-title":"Phys. Lett. A."},{"key":"1166_CR38","doi-asserted-by":"publisher","first-page":"1862","DOI":"10.1093\/cercor\/bhr269","volume":"22","author":"XN Zuo","year":"2012","unstructured":"Zuo, X.N., Ehmke, R., Mennes, M., Imperati, D., Castellanos, F.X., Sporns, O., Milham, M.P.: Network centrality in the human functional connectome. Cereb Cortex. 22, 1862\u20131875 (2012)","journal-title":"Cereb Cortex."},{"key":"1166_CR39","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1016\/j.mcm.2010.02.031","volume":"52","author":"F Pedroche","year":"2010","unstructured":"Pedroche, F.: , Competitivity groups on social network sites. Math. Comput. Model. 52, 1052\u20131057 (2010)","journal-title":"Math. Comput. Model."},{"key":"1166_CR40","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.cam.2014.02.018","volume":"267","author":"P Amodio","year":"2014","unstructured":"Amodio, P., Brugnano, L.: Recent advances in bibliometirc indexes and the PageRank problem. J. Comput. Appl. Math. 267, 182\u2013194 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"1166_CR41","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.: Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations. Comput. Math. Appl. 56, 1\u201324 (2008)","journal-title":"Comput. Math. Appl."},{"key":"1166_CR42","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":"1166_CR43","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 Arnoldis process for large unsymmetric eigenproblems. Linear Algebra Appl. 259, 1\u201323 (1997)","journal-title":"Linear Algebra Appl."},{"key":"1166_CR44","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":"1166_CR45","doi-asserted-by":"publisher","first-page":"725","DOI":"10.2298\/FIL1903725T","volume":"33","author":"ZL Tian","year":"2019","unstructured":"Tian, Z.L., Liu, X.Y., Wang, Y.D., Wen, P.H.: The modified matrix splitting iteration method for computing PageRank problem. Filomat. 33, 725\u2013740 (2019)","journal-title":"Filomat."},{"key":"1166_CR46","doi-asserted-by":"publisher","first-page":"2900","DOI":"10.1016\/j.laa.2008.01.018","volume":"428","author":"ZZ Bai","year":"2008","unstructured":"Bai, Z.Z., Wang, Z.Q.: On parameterized inexact Uzawa methods for generalized saddle point problems. Linear Algebra Appl. 428, 2900\u20132932 (2008)","journal-title":"Linear Algebra Appl."},{"key":"1166_CR47","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":"1166_CR48","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":"1166_CR49","doi-asserted-by":"publisher","first-page":"113295","DOI":"10.1016\/j.cam.2020.113295","volume":"388","author":"ZL Tian","year":"2021","unstructured":"Tian, Z.L., Zhang, Y., Wang, J.X., Gu, C.Q.: Several relaxed iteration methods for computing PageRank. J. Comput. Appl. Math. 388, 113295 (2021)","journal-title":"J. Comput. Appl. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01166-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01166-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01166-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T02:26:35Z","timestamp":1675650395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01166-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,31]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1166"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01166-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,31]]},"assertion":[{"value":"14 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}