{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:56:52Z","timestamp":1758268612956,"version":"3.37.3"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801463"],"award-info":[{"award-number":["11801463"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11601323"],"award-info":[{"award-number":["11601323"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012551","name":"Applied Basic Research Program of Sichuan Province","doi-asserted-by":"publisher","award":["2020YJ0007"],"award-info":[{"award-number":["2020YJ0007"]}],"id":[{"id":"10.13039\/100012551","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004733","name":"Universidade de Macau","doi-asserted-by":"publisher","award":["MYRG2018-00025- FST","MYRG2020-00208-FST"],"award-info":[{"award-number":["MYRG2018-00025- FST","MYRG2020-00208-FST"]}],"id":[{"id":"10.13039\/501100004733","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-01175-w","type":"journal-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T05:02:32Z","timestamp":1628485352000},"page":"1845-1863","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Hessenberg-type algorithm for computing PageRank Problems"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7895-2050","authenticated-orcid":false,"given":"Xian-Ming","family":"Gu","sequence":"first","affiliation":[]},{"given":"Siu-Long","family":"Lei","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhao-Li","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Chun","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Carpentieri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,9]]},"reference":[{"key":"1175_CR1","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web, Technical Report No. 1999-66, Stanford InfoLab., Jan. 29, 1999, 17 pages. Available online at: http:\/\/ilpubs.stanford.edu:8090\/422\/"},{"key":"1175_CR2","doi-asserted-by":"publisher","unstructured":"Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Extrapolation methods for accelerating PageRank computations, in: WWW \u201903 Proceedings of the 12th international conference on World Wide Web, Budapest, Hungary, May 20-24, 2003, ACM New York, NY (2003): 261\u2013270. https:\/\/doi.org\/10.1145\/775152.775190","DOI":"10.1145\/775152.775190"},{"key":"1175_CR3","doi-asserted-by":"crossref","unstructured":"Kamvar, S., Haveliwala, T., Golub, G.: Adaptive methods for the computation of PageRank, Linear Algebra Appl., 386 (2004): 51\u201365","DOI":"10.1016\/j.laa.2003.12.008"},{"key":"1175_CR4","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside PageRank, Internet Math., 1(3) (2005): 335\u2013380","DOI":"10.1080\/15427951.2004.10129091"},{"key":"1175_CR5","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: A survey of eigenvector methods of web information retrieval, SIAM Rev., 47(1) (2005): 135\u2013161","DOI":"10.1137\/S0036144503424786"},{"key":"1175_CR6","doi-asserted-by":"crossref","unstructured":"Berkhin, P.: A survey on PageRank computing, Internet Math., 2(1) (2005): 73\u2013120","DOI":"10.1080\/15427951.2005.10129098"},{"key":"1175_CR7","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and beyond: the Science of Search Engine Rankings, Princeton University Press, Princeton, NJ (2006)","DOI":"10.1515\/9781400830329"},{"key":"1175_CR8","doi-asserted-by":"crossref","unstructured":"Gleich, D.F.: PageRank beyond the web, SIAM Rev., 57(3) (2015): 321\u2013363","DOI":"10.1137\/140976649"},{"key":"1175_CR9","doi-asserted-by":"crossref","unstructured":"Bryan, K., Leise, T.: The 25,000,000,000 eigenvector: the linear algebra behind Google, SIAM Rev., 48(3) (2006): 569\u2013581","DOI":"10.1137\/050623280"},{"key":"1175_CR10","doi-asserted-by":"crossref","unstructured":"Cicone, A., Serra-Capizzano, S.: Google PageRanking problem: the model and the analysis, J. Comput. Appl. Math., 234(11) (2010): 3140\u20133169","DOI":"10.1016\/j.cam.2010.02.005"},{"key":"1175_CR11","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte Carlo methods in PageRank computation: when one iteration is sufficient, SIAM J. Numer. Anal., 45(2) (2007): 890\u2013904","DOI":"10.1137\/050643799"},{"key":"1175_CR12","doi-asserted-by":"crossref","unstructured":"Liu, W., Li, G., Cheng, J.: Fast PageRank approximation by adaptive sampling, Knowl. Inf. Syst., 42(1) (2015): 127\u2013146","DOI":"10.1007\/s10115-013-0691-1"},{"key":"1175_CR13","doi-asserted-by":"crossref","unstructured":"Tan, X.: A new extrapolation method for PageRank computations, J. Comput. Appl. Math., 313 (2017): 383\u2013392","DOI":"10.1016\/j.cam.2016.08.034"},{"key":"1175_CR14","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: A reordering for the PageRank problem, SIAM J. Sci. Comput., 27(6) (2006): 2112\u20132120","DOI":"10.1137\/040607551"},{"key":"1175_CR15","doi-asserted-by":"crossref","unstructured":"Lin, Y., Shi, X., Wei, Y.: On computing PageRank via lumping the Google matrix, J. Comput. Appl. Math., 224(2) (2009): 702\u2013708","DOI":"10.1016\/j.cam.2008.06.003"},{"key":"1175_CR16","doi-asserted-by":"crossref","unstructured":"Gleich, D.F., Gray, A.P., Greif, C., Lau, T.: An inner-outer iteration for computing PageRank, SIAM J. Sci. Comput., 32(1) (2010): 349\u2013371","DOI":"10.1137\/080727397"},{"key":"1175_CR17","doi-asserted-by":"crossref","unstructured":"Heyouni, M., Sadok, H.: On a variable smoothing procedure for Krylov subspace methods, Linear Algebra Appl., 268 (1998): 131\u2013149","DOI":"10.1016\/S0024-3795(97)00037-2"},{"key":"1175_CR18","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Numerical methods for large eigenvalue problems (Revised Ed.), SIAM, Philadelphia, PA (2011)","DOI":"10.1137\/1.9781611970739"},{"key":"1175_CR19","doi-asserted-by":"crossref","unstructured":"Jia, Z.: Refined iterative algorithms based on Arnoldi\u2019s process for large unsymmetric eigenproblems, Linear Algebra Appl., 259 (1997): 1\u201323","DOI":"10.1016\/S0024-3795(96)00238-8"},{"key":"1175_CR20","doi-asserted-by":"crossref","unstructured":"Jia, Z.: Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm, Linear Algebra Appl., 287(1-3) (1999): 191\u2013214","DOI":"10.1016\/S0024-3795(98)10197-0"},{"key":"1175_CR21","doi-asserted-by":"crossref","unstructured":"Jia, Z.: A refined subspace iteration algorithm for large sparse eigenproblems, Appl. Numer. Math., 32(1) (2000): 35\u201352","DOI":"10.1016\/S0168-9274(99)00008-2"},{"key":"1175_CR22","doi-asserted-by":"crossref","unstructured":"Golub, G.H., Greif, C.: An Arnoldi-type algorithm for computing page rank, BIT, 46(4) (2006): 759\u2013771","DOI":"10.1007\/s10543-006-0091-y"},{"key":"1175_CR23","doi-asserted-by":"crossref","unstructured":"Wu, G., Wei, Y.: A Power-Arnoldi algorithm for computing PageRank, Numer. Linear Algebra Appl., 14(7) (2007): 521\u2013546","DOI":"10.1002\/nla.531"},{"key":"1175_CR24","doi-asserted-by":"publisher","unstructured":"Yin, G.-J., Yin, J.-F.: On Arnoldi method accelerating PageRank cmputations, in: Web Information Systems and Mining. WISM 2010 (F.-L. Wang, Z. Gong, X. Luo, J. Lei, eds.), Lecture Notes in Computer Science, vol 6318, Springer, Berlin, Heidelberg (2010): 378\u2013385. https:\/\/doi.org\/10.1007\/978-3-642-16515-3_47","DOI":"10.1007\/978-3-642-16515-3_47"},{"key":"1175_CR25","doi-asserted-by":"crossref","unstructured":"Wu, G., Zhang, Y., Wei, Y.: Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem, J. Sci. Comput., 57(1) (2013): 74\u2013104","DOI":"10.1007\/s10915-013-9696-x"},{"key":"1175_CR26","doi-asserted-by":"crossref","unstructured":"Wu, G., Wei, Y.: An Arnoldi-extrapolation algorithm for computing PageRank, J. Comput. Appl. Math., 234(11) (2010): 3196\u20133212","DOI":"10.1016\/j.cam.2010.02.009"},{"key":"1175_CR27","doi-asserted-by":"crossref","unstructured":"Gu, C., Wang, W.: An Arnoldi-Inout algorithm for computing PageRank problems, J. Comput. Appl. Math., 309 (2017): 219\u2013229","DOI":"10.1016\/j.cam.2016.05.026"},{"key":"1175_CR28","doi-asserted-by":"crossref","unstructured":"Yin, J.-F., Yin, G.-J., Ng, M.: On adaptively accelerated Arnoldi method for computing PageRank, Numer. Linear Algebra Appl., 19(1) (2012): 73\u201385","DOI":"10.1002\/nla.789"},{"key":"1175_CR29","doi-asserted-by":"crossref","unstructured":"Freund, R.W., Hochbruck, M.: On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling, Numer. Linear Algebra Appl., 1(4) (1994): 403\u2013420","DOI":"10.1002\/nla.1680010406"},{"key":"1175_CR30","doi-asserted-by":"publisher","unstructured":"Teramoto, K., Nodera, T.: A note on Lanczos algorithm for computing PageRank, in: Forging Connections between Computational Mathematics and Computational Geometry (K. Chen, A. Ravindran, eds.), Springer Proceedings in Mathematics & Statistics, Vol. 124, Springer, Cham, Switzerland (2016): 25\u201333. https:\/\/doi.org\/10.5176\/2251-1911_CMCGS14.15_3","DOI":"10.5176\/2251-1911_CMCGS14.15_3"},{"key":"1175_CR31","doi-asserted-by":"crossref","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) (2012): A2558\u2013A2575","DOI":"10.1137\/110834585"},{"key":"1175_CR32","doi-asserted-by":"publisher","unstructured":"Wu, G., Wei, Y.: Arnoldi versus GMRES for computing pageRank: A theoretical contribution to google\u2019s pageRank problem, ACM Trans Inf. Syst., 28(3) (2010): 11. https:\/\/doi.org\/10.1145\/1777432.1777434https:\/\/doi.org\/10.1145\/1777432.1777434","DOI":"10.1145\/1777432.1777434 10.1145\/1777432.1777434"},{"key":"1175_CR33","unstructured":"Hessenberg, K.: Behandlung Linearer Eigenwertaufgaben Mit Hilfe Der Hamilton-Cayleyschen Gleichung, Numerische Verfahren, Bericht 1, Institut F\u00fcr Praktische Mathematik (IPM), Technische Hochschule Darmstadt. The scanned report and a biographical sketch of Karl Hessenberg\u2019s life are available at. http:\/\/www.hessenberg.de\/karl1.html (1940)"},{"key":"1175_CR34","unstructured":"Wilkinson, J.H.: The algebraic eigenvalue problem, Clarendon Press, Oxford, UK (1965)"},{"issue":"4","key":"1175_CR35","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1023\/A:1019164119887","volume":"20","author":"H Sadok","year":"1999","unstructured":"Sadok, H.: CMRH: a new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm. Numer. Algorithms 20 (4), 303\u2013321 (1999)","journal-title":"Numer. Algorithms"},{"key":"1175_CR36","unstructured":"Stephens, D.: ELMRES: An oblique projection method to solve sparse non-symmetric linear systems (Ph.D Dissertation), Florida Institute of Technology, Melbourne USA. http:\/\/ncsu.edu\/hpc\/Documents\/Publications\/gary_howell\/stephens.pdf (1999)"},{"key":"1175_CR37","doi-asserted-by":"crossref","unstructured":"Householder, A.S., Bauer, F.L.: On certain methods for expanding the characteristic polynomial, Numer. Math., 1(1) (1959): 29\u201337","DOI":"10.1007\/BF01386370"},{"key":"1175_CR38","doi-asserted-by":"crossref","unstructured":"Sadok, H., Szyld, D.B.: A new look at CMRH and its relation to GMRES, BIT, 52(2) (2012): 485\u2013501","DOI":"10.1007\/s10543-011-0365-x"},{"key":"1175_CR39","doi-asserted-by":"crossref","unstructured":"Heyouni, M., Sadok, H.: A new implementation of the CMRH method for solving dense linear systems, J. Comput. Appl. Math., 213(2) (2008): 387\u2013399","DOI":"10.1016\/j.cam.2007.01.004"},{"key":"1175_CR40","doi-asserted-by":"crossref","unstructured":"Zhang, K., Gu, C.: Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides, J. Comput. Appl. Math., 263 (2014): 312\u2013325","DOI":"10.1016\/j.cam.2013.12.017"},{"key":"1175_CR41","doi-asserted-by":"crossref","unstructured":"Heyouni, M.: The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides, Numer. Algorithms, 26(4) (2001): 317\u2013332","DOI":"10.1023\/A:1016603612931"},{"key":"1175_CR42","doi-asserted-by":"crossref","unstructured":"Heyouni, M., Essai, A.: Matrix Krylov subspace methods for linear systems with multiple right-hand sides, Numer. Algorithms, 40(2) (2005): 137\u2013156","DOI":"10.1007\/s11075-005-1526-2"},{"key":"1175_CR43","doi-asserted-by":"crossref","unstructured":"Amini, S., Toutounian, F., Gachpazan, M.: The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides, J. Comput. Appl. Math., 337 (2018): 166\u2013174","DOI":"10.1016\/j.cam.2018.01.012"},{"issue":"8","key":"1175_CR44","doi-asserted-by":"publisher","first-page":"2011","DOI":"10.1016\/j.camwa.2018.07.045","volume":"76","author":"S Amini","year":"2018","unstructured":"Amini, S., Toutounian, F.: Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides. Comput. Math. Appl. 76(8), 2011\u20132021 (2018)","journal-title":"Comput. Math. Appl."},{"key":"1175_CR45","doi-asserted-by":"crossref","unstructured":"Gu, X.-M., Huang, T.-Z., Yin, G., Carpentieri, B., Wen, C., Du, L.: Restarted Hessenberg method for solving shifted nonsymmetric linear systems, J. Comput. Appl. Math., 331 (2018): 166\u2013177","DOI":"10.1016\/j.cam.2017.09.047"},{"key":"1175_CR46","doi-asserted-by":"publisher","unstructured":"Gu, X.-M., Huang, T.-Z., Carpentieri, B., Imakura, A., Zhang, K., Du, L.: Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously, J. Comput. Appl. Math., 375 (2020): 112788. https:\/\/doi.org\/10.1016\/j.cam.2020.112788","DOI":"10.1016\/j.cam.2020.112788"},{"key":"1175_CR47","doi-asserted-by":"crossref","unstructured":"Ramezani, Z., Toutounian, F.: Extended and rational Hessenberg methods for the evaluation of matrix functions, BIT, 59(2) (2019): 523\u2013545","DOI":"10.1007\/s10543-018-0742-9"},{"key":"1175_CR48","unstructured":"Addam, M., Heyouni, M., Sadok, H.: The block Hessenberg process for matrix equations, Electron. Trans. Numer. Anal., 46 (2017): 460\u2013473"},{"key":"1175_CR49","doi-asserted-by":"crossref","unstructured":"Heyouni, M., Saberi-Movahed, F., Tajaddini, A.: On global Hessenberg based methods for solving Sylvester matrix equations, Comput. Math. Appl., 77(1) (2019): 77\u201392","DOI":"10.1016\/j.camwa.2018.09.015"},{"key":"1175_CR50","doi-asserted-by":"crossref","unstructured":"Businger, P.A.: Reducing a matrix to Hessenberg form, Math. Comp., 23(108) (1969): 819\u2013821","DOI":"10.1090\/S0025-5718-1969-0258255-3"},{"key":"1175_CR51","doi-asserted-by":"crossref","unstructured":"Heyouni, M.: Newton Generalized Hessenberg method for solving nonlinear systems of equations, Numer. Algorithms, 21(1-4) (1999): 225\u2013246","DOI":"10.1023\/A:1019130001657"},{"key":"1175_CR52","doi-asserted-by":"crossref","unstructured":"Astudillo, R., van Gijzen, M.B.: A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices, J. Comput. Appl. Math., 296 (2016): 24\u201335","DOI":"10.1016\/j.cam.2015.09.014"},{"key":"1175_CR53","doi-asserted-by":"crossref","unstructured":"Gutknecht, M.H., Zemke, J.-P.M.: Eigenvalue computations based on IDR, SIAM J. Matrix Anal. Appl., 34(2) (2013): 283\u2013311","DOI":"10.1137\/100804012"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01175-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01175-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01175-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T10:24:30Z","timestamp":1647858270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01175-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":53,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1175"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01175-w","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"7 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}