{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:28Z","timestamp":1740123688524,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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-01336-5","type":"journal-article","created":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T08:03:57Z","timestamp":1657094637000},"page":"1183-1212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid iterative refined restarted Lanczos bidiagonalization methods"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7312-6374","authenticated-orcid":false,"given":"James","family":"Baglama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilije","family":"Perovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Picucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,6]]},"reference":[{"issue":"18","key":"1336_CR1","doi-asserted-by":"publisher","first-page":"10101","DOI":"10.1073\/pnas.97.18.10101","volume":"97","author":"O Alter","year":"2000","unstructured":"Alter, O., Brown, P.O., Botstein, D.: Singular value decomposition for genome-wide expression data processing and modeling. Proc. Natl. Acad. Sci. 97(18), 10101\u201310106 (2000)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"5","key":"1336_CR2","doi-asserted-by":"publisher","first-page":"S200","DOI":"10.1137\/20M1344834","volume":"43","author":"J Baglama","year":"2021","unstructured":"Baglama, J., Bella, T., Picucci, J.: Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix. SIAM J. Sci. Comput. 43(5), S200\u2013S224 (2021)","journal-title":"SIAM J. Sci. Comput."},{"key":"1336_CR3","unstructured":"Baglama, J., Kane, M., Lewis, B., Poliakov, A.: Efficient thresholded correlation using truncated singular value decomposition. arXiv:1512.07246 (2015)"},{"issue":"1","key":"1336_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/04060593X","volume":"27","author":"J Baglama","year":"2005","unstructured":"Baglama, J., Reichel, L.: Augmented implicitly restarted Lanczos bidiagonalization methods. SIAM J. Sci. Comput. 27(1), 19\u201342 (2005)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"1336_CR5","first-page":"285","volume":"53","author":"J Baglama","year":"2013","unstructured":"Baglama, J., Reichel, L.: An implicitly restarted block Lanczos bidiagonalization method using Leja shifts. BIT Numer. Math. 53(2), 285\u2013310 (2013)","journal-title":"BIT Numer. Math."},{"key":"1336_CR6","first-page":"85","volume":"42","author":"J Baglama","year":"2014","unstructured":"Baglama, J., Richmond, D.J.: Implicitly restarting the LSQR algorithm. Electron. Trans. Numer. Anal. 42, 85\u2013105 (2014)","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"1","key":"1336_CR7","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"1336_CR8","doi-asserted-by":"crossref","unstructured":"Eld\u00e9n, L.: Matrix methods in data mining and pattern recognition. SIAM (2007)","DOI":"10.1137\/1.9780898718867"},{"issue":"4","key":"1336_CR9","doi-asserted-by":"publisher","first-page":"A2172","DOI":"10.1137\/18M1222004","volume":"41","author":"S Goldenberg","year":"2019","unstructured":"Goldenberg, S., Stathopoulos, A., Romero, E.: A golub\u2013Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices. SIAM J. Sci. Comput. 41(4), A2172\u2013A2192 (2019)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"1336_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/0702016","volume":"2","author":"G Golub","year":"1965","unstructured":"Golub, G., Kahan, W.: Calculating the singular values and pseudo-inverse of a matrix. Journal of the Society for Industrial & Applied Mathematics, Series B: Numerical Analysis 2(2), 205\u2013224 (1965)","journal-title":"Journal of the Society for Industrial & Applied Mathematics, Series B: Numerical Analysis"},{"key":"1336_CR11","doi-asserted-by":"crossref","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. The Johns Hopkins University Press (2013)","DOI":"10.56021\/9781421407944"},{"issue":"4","key":"1336_CR12","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10543-004-5244-2","volume":"44","author":"ME Hochstenbach","year":"2004","unstructured":"Hochstenbach, M.E.: Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems. BIT Numer. Math. 44(4), 721\u2013754 (2004)","journal-title":"BIT Numer. Math."},{"key":"1336_CR13","first-page":"235","volume":"20","author":"ME Hochstenbach","year":"2005","unstructured":"Hochstenbach, M.E.: Generalizations of harmonic and refined rayleigh-Ritz. Electron. Trans. Numer. Anal. 20, 235\u2013252 (2005)","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"1","key":"1336_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/nla.562","volume":"15","author":"ME Hochstenbach","year":"2008","unstructured":"Hochstenbach, M.E., Sleijpen, G.L.: Harmonic and refined rayleigh\u2013Ritz for the polynomial eigenvalue problem. Numerical Linear Algebra Appl. 15 (1), 35\u201354 (2008)","journal-title":"Numerical Linear Algebra Appl."},{"key":"1336_CR15","doi-asserted-by":"publisher","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 Algebra Appl. 259, 1\u201323 (1997)","journal-title":"Linear Algebra Appl."},{"issue":"1-3","key":"1336_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0024-3795(98)10197-0","volume":"287","author":"Z Jia","year":"1999","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), 191\u2013214 (1999)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"1336_CR17","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0168-9274(01)00132-5","volume":"42","author":"Z Jia","year":"2002","unstructured":"Jia, Z.: The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices. Appl. Numer. Math. 42(4), 489\u2013512 (2002)","journal-title":"Appl. Numer. Math."},{"issue":"1","key":"1336_CR18","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1360\/04za0020","volume":"47","author":"Z Jia","year":"2004","unstructured":"Jia, Z.: Some theoretical comparisons of refined Ritz vectors and Ritz vectors. Science in China Series A: Mathematics 47(1), 222\u2013233 (2004)","journal-title":"Science in China Series A: Mathematics"},{"issue":"251","key":"1336_CR19","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1090\/S0025-5718-04-01684-9","volume":"74","author":"Z Jia","year":"2005","unstructured":"Jia, Z.: The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors. Math. Comput. 74(251), 1441\u20131456 (2005)","journal-title":"Math. Comput."},{"issue":"1","key":"1336_CR20","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1137\/S0895479802404192","volume":"25","author":"Z Jia","year":"2003","unstructured":"Jia, Z., Niu, D.: An implicitly restarted refined bidiagonalization Lanczos method for computing a partial singular value decomposition. SIAM Journal on Matrix Analysis and Applications 25(1), 246\u2013265 (2003)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"1336_CR21","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1137\/080733383","volume":"32","author":"Z Jia","year":"2010","unstructured":"Jia, Z., Niu, D.: A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices. SIAM J. Sci. Comput. 32(2), 714\u2013744 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"234","key":"1336_CR22","doi-asserted-by":"publisher","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\u2013Ritz method for approximating eigenspaces. Math. Comput. 70(234), 637\u2013647 (2001)","journal-title":"Math. Comput."},{"issue":"3","key":"1336_CR23","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.camwa.2010.05.034","volume":"60","author":"W Jiang","year":"2010","unstructured":"Jiang, W., Wu, G.: A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems. Comput. Math. Appl. 60(3), 873\u2013889 (2010)","journal-title":"Comput. Math. Appl."},{"key":"1336_CR24","doi-asserted-by":"crossref","unstructured":"Jolliffe, I.: Principal component analysis. Wiley Online Library (2005)","DOI":"10.1002\/0470013192.bsa501"},{"key":"1336_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.apnum.2003.11.011","volume":"49","author":"E Kokiopoulou","year":"2004","unstructured":"Kokiopoulou, E., Bekas, C., Gallopoulos, E.: Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization. Appl. Numer. Math. 49, 39\u201361 (2004). https:\/\/doi.org\/10.1016\/j.apnum.2003.11.011","journal-title":"Appl. Numer. Math."},{"key":"1336_CR26","unstructured":"Larsen, R.: Combining implicit restart and partial reorthogonalization in Lanczos bidiagnalization (2001)"},{"key":"1336_CR27","doi-asserted-by":"crossref","unstructured":"Lehoucq, R.B., Sorensen, D.C., Yang, C.: ARPACK Users\u2019 guide: Solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods. SIAM (1998)","DOI":"10.1137\/1.9780898719628"},{"key":"1336_CR28","first-page":"197","volume":"42","author":"Q Liang","year":"2014","unstructured":"Liang, Q., Ye, Q.: Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method. Electron. Trans. Numer. Anal. 42, 197 (2014)","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"215","key":"1336_CR29","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1090\/S0025-5718-96-00745-4","volume":"65","author":"RB Morgan","year":"1996","unstructured":"Morgan, R.B.: On restarting the Arnoldi method for large nonsymmetric eigenvalue problems. Math. Comput. 65(215), 1213\u20131230 (1996)","journal-title":"Math. Comput."},{"key":"1336_CR30","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.cam.2013.09.066","volume":"260","author":"D Niu","year":"2014","unstructured":"Niu, D., Yuan, X.: An implicitly restarted lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets. J. Comput. Appl. Math. 260, 208\u2013217 (2014)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1336_CR31","doi-asserted-by":"publisher","first-page":"414","DOI":"10.3758\/s13428-010-0050-z","volume":"43","author":"AM Olney","year":"2011","unstructured":"Olney, A.M.: Large-scale latent semantic analysis. Behavior Research Methods 43(2), 414\u2013423 (2011)","journal-title":"Behavior Research Methods"},{"issue":"1","key":"1336_CR32","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"CC Paige","year":"1982","unstructured":"Paige, C.C., Saunders, M.A.: LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Transactions on Mathematical Software (TOMS) 8(1), 43\u201371 (1982)","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"1336_CR33","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0024-3795(80)90169-X","volume":"34","author":"Y Saad","year":"1980","unstructured":"Saad, Y.: Variations on Arnoldi\u2019s method for computing eigenelements of large unsymmetric matrices. Linear Algebra Appl. 34, 269\u2013295 (1980)","journal-title":"Linear Algebra Appl."},{"key":"1336_CR34","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Numerical methods for large eigenvalue problems: revised edition society for industrial and applied mathematics (2011)","DOI":"10.1137\/1.9781611970739"},{"issue":"1","key":"1336_CR35","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/0613025","volume":"13","author":"DC Sorensen","year":"1992","unstructured":"Sorensen, D.C.: Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13(1), 357\u2013385 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1336_CR36","unstructured":"Stathopoulos, A.: Locking Issues for Finding a Large Number of Eigenvectors of Hermitian Matrices. Tech. rep., Citeseer (2005)"},{"key":"1336_CR37","doi-asserted-by":"publisher","unstructured":"Stewart, G. W.: Matrix algorithms: Volume II: eigensystems society for industrial and applied mathematics. https:\/\/doi.org\/10.1137\/1.9780898718058 (2001)","DOI":"10.1137\/1.9780898718058"},{"issue":"8","key":"1336_CR38","doi-asserted-by":"publisher","first-page":"2795","DOI":"10.1016\/j.laa.2011.07.022","volume":"436","author":"M Stoll","year":"2012","unstructured":"Stoll, M.: A Krylov\u2013Schur approach to the truncated SVD. Linear Algebra Appl. 436(8), 2795\u20132806 (2012)","journal-title":"Linear Algebra Appl."},{"key":"1336_CR39","doi-asserted-by":"crossref","unstructured":"Wu, K., Simon, H.: Dynamic restarting schemes for eigenvalue problems. Tech. rep., Lawrence Berkeley National Lab. CA (US) (1999)","DOI":"10.2172\/760299"},{"issue":"2","key":"1336_CR40","doi-asserted-by":"publisher","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(2), 602\u2013616 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"1336_CR41","doi-asserted-by":"publisher","first-page":"S248","DOI":"10.1137\/16M1082214","volume":"39","author":"L Wu","year":"2017","unstructured":"Wu, L., Romero, E., Stathopoulos, A.: Primme_svds: a high-performance preconditioned svd solver for accurate large-scale computations. SIAM J. Sci. Comput. 39(5), S248\u2013S271 (2017)","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01336-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01336-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01336-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T08:33:58Z","timestamp":1673512438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01336-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1336"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01336-5","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"30 July 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":"6 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}}]}}