{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:36:33Z","timestamp":1761917793414},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T00:00:00Z","timestamp":1361836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10915-013-9696-x","type":"journal-article","created":{"date-parts":[[2013,2,25]],"date-time":"2013-02-25T07:36:11Z","timestamp":1361777771000},"page":"74-104","source":"Crossref","is-referenced-by-count":15,"title":["Accelerating the Arnoldi-Type Algorithm for the PageRank Problem and the ProteinRank Problem"],"prefix":"10.1007","volume":"57","author":[{"given":"Gang","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yimin","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,26]]},"reference":[{"key":"9696_CR1","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1038\/35057460","volume":"409","author":"A Abbott","year":"2001","unstructured":"Abbott, A.: And now for the proteome. Nature 409, 747 (2001)","journal-title":"Nature"},{"key":"9696_CR2","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1137\/050643799","volume":"45","author":"K Avrachenkov","year":"2007","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, 890\u2013904 (2007)","journal-title":"SIAM J. Numer. Anal."},{"key":"9696_CR3","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1137\/S0036144503433077","volume":"47","author":"C Beattie","year":"2005","unstructured":"Beattie, C., Embree, M., Sorensen, D.: Convergence of polynomial restart Krylov methods for eigenvalue computation. SIAM Rev. 47, 492\u2013515 (2005)","journal-title":"SIAM Rev."},{"key":"9696_CR4","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/070711487","volume":"48","author":"M Bellalij","year":"2010","unstructured":"Bellalij, M., Saad, Y., Sadok, H.: Further analysis of the Arnoldi process for eigenvalue problems. SIAM J. Numer. Anal. 48, 393\u2013407 (2010)","journal-title":"SIAM J. Numer. Anal."},{"key":"9696_CR5","doi-asserted-by":"crossref","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":"9696_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971262","volume-title":"Nonnegative Matrices in the Mathematical Sciences","author":"A Berman","year":"1994","unstructured":"Berman, A., Plemmons, R.: Nonnegative Matrices in the Mathematical Sciences, 2nd edn. SIAM, Philadelphia (1994)","edition":"2"},{"key":"9696_CR7","doi-asserted-by":"crossref","unstructured":"Boldi, P., Santini, M., Vigna, S.: PageRank: functional dependencies. ACM Trans. Inf. Syst. 27(1) (2009)","DOI":"10.1145\/1629096.1629097"},{"key":"9696_CR8","doi-asserted-by":"crossref","first-page":"1585","DOI":"10.1090\/S0025-5718-08-02086-3","volume":"77","author":"C Brezinski","year":"2008","unstructured":"Brezinski, C., Redivo-Zaglia, M.: Rational extrapolation for the PageRank vector. Math. Comput. 77, 1585\u20131598 (2008)","journal-title":"Math. Comput."},{"key":"9696_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1504\/IJBRA.2011.039172","volume":"7","author":"Z Chen","year":"2011","unstructured":"Chen, Z., Cai, Z., Li, M., Liu, B.: Using search engine technology for protein function prediction. Inter. J. Bio. Res. Appl. 7, 101\u2013113 (2011)","journal-title":"Inter. J. Bio. Res. Appl."},{"key":"9696_CR10","doi-asserted-by":"crossref","first-page":"3140","DOI":"10.1016\/j.cam.2010.02.005","volume":"234","author":"A Cicone","year":"2010","unstructured":"Cicone, A., Serra-Capizzano, S.: Google PageRanking problem: the model and the analysis. J. Comput. Appl. Math. 234, 3140\u20133169 (2010)","journal-title":"J. Comput. Appl. Math."},{"key":"9696_CR11","unstructured":"Cipra, B.: The best of the 20th century: editors name top 10 algorithms. SIAM News 33(4) (2000)"},{"key":"9696_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/15427951.2009.10129185","volume":"6","author":"P Constantine","year":"2010","unstructured":"Constantine, P., Gleich, D.: Random alpha PageRank. Internet Math. 6, 189\u2013236 (2010)","journal-title":"Internet Math."},{"key":"9696_CR13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.cam.2006.10.080","volume":"210","author":"G Corso Del","year":"2007","unstructured":"Del Corso, G., Gull\u00ec, A., Romani, F.: Comparison of Krylov subspace methods on the PageRank problem. J. Comput. Appl. Math. 210, 159\u2013166 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"9696_CR14","doi-asserted-by":"crossref","unstructured":"Freschi, V.: Protein function prediction from interaction networks using a random walk ranking algorithm. In: Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 14\u201317, pp. 42\u201348 (2007)","DOI":"10.1109\/BIBE.2007.4375543"},{"key":"9696_CR15","unstructured":"Gleich, D., Zhukov, L., Berkhin, P.: Fast Parallel PageRank: A Linear System Approach. Technical Report, Yahoo! (2004)"},{"key":"9696_CR16","doi-asserted-by":"crossref","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":"9696_CR17","doi-asserted-by":"crossref","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":"9696_CR18","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"9696_CR19","doi-asserted-by":"crossref","first-page":"066702","DOI":"10.1103\/PhysRevE.66.066702","volume":"66","author":"P Grindrod","year":"2002","unstructured":"Grindrod, P.: Range-dependent random graphs and their application to modelling large small-world proteome datasets. Phys. Rev E. 66, 066702 (2002)","journal-title":"Phys. Rev E."},{"key":"9696_CR20","unstructured":"Haveliwala, T., Kamvar, S.: The second eigenvalue of the Google matrix. Stanford University Technical Report (2003)"},{"key":"9696_CR21","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002)","edition":"2"},{"key":"9696_CR22","doi-asserted-by":"crossref","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, 1281\u20131296 (2007)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9696_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0024-3795(96)00238-8","volume":"259","author":"Z Jia","year":"1997","unstructured":"Jia, Z.: Refined iterative algorithms based on Arnoldi\u2019s process for large unsymmetric eigenproblems. Linear Algeb. Appl. 259, 1\u201323 (1997)","journal-title":"Linear Algeb. Appl."},{"key":"9696_CR24","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0025-5718-00-01208-4","volume":"70","author":"Z Jia","year":"2001","unstructured":"Jia, Z., Stewart, G.W.: An analysis of the Rayleigh-Ritz method for approximating eigenspaces. Math. Comput. 70, 637\u2013647 (2001)","journal-title":"Math. Comput."},{"key":"9696_CR25","doi-asserted-by":"crossref","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., Golub, G.H.: Extrapolation methods for accelerating PageRank computations. In: Proceedings of the 12th Conference on International, World Wide Web (2003)","DOI":"10.1145\/775152.775190"},{"key":"9696_CR26","doi-asserted-by":"crossref","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.H.: Adaptive methods for the computation of PageRank. Linear Algeb. Appl. 386, 51\u201365 (2004)","journal-title":"Linear Algeb. Appl."},{"key":"9696_CR27","unstructured":"Kollias, G., Gallopoulos E.: Functional rankings with multidamping: Generalizing PageRank with inhomogeneous matrix products (submitted)"},{"key":"9696_CR28","doi-asserted-by":"crossref","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":"9696_CR29","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and beyond: the science of search engine rankings","author":"A Langville","year":"2006","unstructured":"Langville, A., Meyer, C.: Google\u2019s PageRank and beyond: the science of search engine rankings. Princeton University Press, Princeton (2006)"},{"key":"9696_CR30","unstructured":"Lee, C., Golub, G.H., Zenios, S.: A Fast Two-Stage Algorithm for Computing PageRank and Its Extensions. Stanford University Technical Report, SCCM-03-15 (2003)"},{"key":"9696_CR31","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01397475","volume":"31","author":"T Manteuffel","year":"1978","unstructured":"Manteuffel, T.: Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration. Numer. Math. 31, 183\u2013208 (1978)","journal-title":"Numer. Math."},{"key":"9696_CR32","unstructured":"Moler, C.: The World\u2019s Largest Matrix Computation. MATLAB News and Notes (2002)"},{"key":"9696_CR33","doi-asserted-by":"crossref","first-page":"2012","DOI":"10.1093\/bioinformatics\/btl338","volume":"2","author":"J Morrison","year":"2006","unstructured":"Morrison, J., Breitling, R., Higham, D., Gilbert, D.: A lock-and-key model for protein-protein interactions. Bioinformatics 2, 2012\u20132019 (2006)","journal-title":"Bioinformatics"},{"key":"9696_CR34","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/0613050","volume":"13","author":"N Nachtigal","year":"1992","unstructured":"Nachtigal, N., Reichel, L., Trefethen, L.: A hybrid GMRES algorithm for nonsymmetric linear systems. SIAM J. Matrix Anal. Appl. 13, 796\u2013825 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9696_CR35","unstructured":"Page, L., Brin, S., Motwami, R., Winograd, T.: The PageRank citation ranking: bring order to the Web, Technical Report. Computer Science Department, Stanford University (1998)"},{"key":"9696_CR36","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0024-3795(76)90018-5","volume":"14","author":"BN Parlett","year":"1976","unstructured":"Parlett, B.N.: A recurrence among the elements of functions of triangular matrices. Linear Algeb. Appl. 14, 117\u2013121 (1976)","journal-title":"Linear Algeb. Appl."},{"key":"9696_CR37","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1090\/S0025-5718-1984-0736453-8","volume":"42","author":"Y Saad","year":"1984","unstructured":"Saad, Y.: Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems. Math. Comput. 42, 567\u2013588 (1984)","journal-title":"Math. Comput."},{"key":"9696_CR38","volume-title":"Numerical Methods for Large Eigenvalue Problems, Algorithms and Architectures for Advanced Scientific Computing","author":"Y Saad","year":"1992","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalue Problems, Algorithms and Architectures for Advanced Scientific Computing. Manchester University Press, Manchester (1992)"},{"key":"9696_CR39","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)","edition":"2"},{"key":"9696_CR40","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/S0895479804441407","volume":"27","author":"S Serra-Capizzano","year":"2005","unstructured":"Serra-Capizzano, S.: Jordan canonical form of the Google matrix: A potential contribution to the PageRank computation. SIAM Matrix Anal. Appl. 27, 305\u2013312 (2005)","journal-title":"SIAM Matrix Anal. Appl."},{"key":"9696_CR41","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1038\/msb4100129","volume":"3","author":"R Sharan","year":"2007","unstructured":"Sharan, R., Ulitsky, I., Shamir, R.: Network-based prediction of protein function. Mol. Syst. Biol. 3, 88 (2007)","journal-title":"Mol. Syst. Biol."},{"key":"9696_CR42","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1019113314010","volume":"18","author":"A Sidi","year":"1998","unstructured":"Sidi, A., Shapira, Y.: Upper bounds for convergence rates of acceleration methods with initial iterations. Numer. Algeb. 18, 113\u2013132 (1998)","journal-title":"Numer. Algeb."},{"key":"9696_CR43","doi-asserted-by":"crossref","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":"9696_CR44","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/0613025","volume":"13","author":"D Sorensen","year":"1992","unstructured":"Sorensen, D.: Implicit application of polynomial filters in a $k$-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13, 357\u2013385 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9696_CR45","volume-title":"Matrix Perturbation Theory","author":"GW Stewart","year":"1990","unstructured":"Stewart, G.W., Sun, J.: Matrix Perturbation Theory. Academic Press, Boston (1990)"},{"key":"9696_CR46","doi-asserted-by":"crossref","unstructured":"Taylor, A., Higham, D.J.: CONTEST: A controllable test matrix toolbox for MATLAB. ACM Trans. Math. Soft. 35(26) (2009)","DOI":"10.1145\/1462173.1462175"},{"key":"9696_CR47","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1080\/15427951.2011.604561","volume":"7","author":"L Wong","year":"2011","unstructured":"Wong, L.: Using biological networks in protein function prediction and gene expression analysis. Internet Math. 7, 274\u2013298 (2011)","journal-title":"Internet Math."},{"key":"9696_CR48","doi-asserted-by":"crossref","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 Algeb. Appl. 14, 521\u2013546 (2007)","journal-title":"Numer. Linear Algeb. Appl."},{"key":"9696_CR49","doi-asserted-by":"crossref","unstructured":"Wu, G., Wei, Y.: Arnoldi versus GMRES for computing PageRank: a theoretical contribution to Google\u2019s PageRank problem. ACM Trans Inf. Syst. 28(11) (2010)","DOI":"10.1145\/1777432.1777434"},{"key":"9696_CR50","doi-asserted-by":"crossref","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":"9696_CR51","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1137\/S0895479898334605","volume":"22","author":"K Wu","year":"2000","unstructured":"Wu, K., Simon, H.: Thick-restart Lanczos method for large symmetric eigenvalue problems. SIAM J. Matrix Anal. Appl. 22, 602\u2013616 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9696_CR52","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1089\/cmb.2009.0004","volume":"17","author":"G Wu","year":"2010","unstructured":"Wu, G., Zhang, Y., Wei, Y.: Krylov subspace algorithms for computing GeneRank for the analysis of microarray data mining. J. Comput. Biol. 17, 631\u2013646 (2010)","journal-title":"J. Comput. Biol."},{"key":"9696_CR53","doi-asserted-by":"crossref","first-page":"A2558","DOI":"10.1137\/110834585","volume":"34","author":"G Wu","year":"2012","unstructured":"Wu, G., Wang, Y., Jin, X.: A preconditioned and shifted GMRES algorithm for the PageRank Problem with multiple damping factors. SIAM J. Sci. Comput. 34, A2558\u2013A2575 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"9696_CR54","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10791-012-9183-2","volume":"15","author":"Q Yu","year":"2012","unstructured":"Yu, Q., Miao, Z., Wu, G., Wei, Y.: Lumping algorithms for computing Google\u2019s Page-Rank and its derivative, with attention to unreferenced nodes. Inform. Retriev. 15, 503\u2013526 (2012)","journal-title":"Inform. Retriev."},{"key":"9696_CR55","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0024-3795(02)00612-2","volume":"367","author":"I Zavorin","year":"2003","unstructured":"Zavorin, I., O\u2019Leary, D., Elman, H.: Complete stagnation of GMRES. Linear Algeb. Appl. 367, 165\u2013183 (2003)","journal-title":"Linear Algeb. Appl."},{"key":"9696_CR56","doi-asserted-by":"crossref","unstructured":"Zhang, H., Goel, A., Govindan, R., Mason, K., Van Roy, B.: Making Eigenvector-Based Reputation System Robust to Collusion. www.stanford.edu\/group\/reputation\/WAW-adapt.ps (2004)","DOI":"10.1007\/978-3-540-30216-2_8"},{"key":"9696_CR57","unstructured":"http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Gleich\/index.html"},{"key":"9696_CR58","unstructured":"http:\/\/www.mathstat.strath.ac.uk\/research\/groups\/numerical_analysis\/contest\/toolbox"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-013-9696-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-013-9696-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-013-9696-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T22:50:16Z","timestamp":1562712616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-013-9696-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,26]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9696"],"URL":"https:\/\/doi.org\/10.1007\/s10915-013-9696-x","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,26]]}}}