{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:03:35Z","timestamp":1750219415038,"version":"3.41.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:00:00Z","timestamp":1722902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:00:00Z","timestamp":1722902400000},"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":[[2025,7]]},"DOI":"10.1007\/s11075-024-01906-9","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T06:03:31Z","timestamp":1722924211000},"page":"1063-1079","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A hybrid algorithm for computing a partial singular value decomposition satisfying a given threshold"],"prefix":"10.1007","volume":"99","author":[{"given":"James","family":"Baglama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan A.","family":"Ch\u00e1vez-Casillas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilije","family":"Perovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,6]]},"reference":[{"issue":"4","key":"1906_CR1","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"1906_CR2","doi-asserted-by":"crossref","unstructured":"Feng, X., Yu, W., Li, Y.: Faster matrix completion using randomized svd. In: 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 608\u2013615 (2018). IEEE","DOI":"10.1109\/ICTAI.2018.00098"},{"key":"1906_CR3","doi-asserted-by":"crossref","unstructured":"Kumar, R., Patbhaje, U., Kumar, A.: An efficient technique for image compression and quality retrieval using matrix completion. J. King Saud Univ. Comput. Inf. Sci. 34(4), 1231\u20131239 (2022)","DOI":"10.1016\/j.jksuci.2019.08.002"},{"key":"1906_CR4","doi-asserted-by":"crossref","unstructured":"Li, C., Zhou, H.: svt: Singular value thresholding in MATLAB. J. Stat. Softw. 81(2) (2017)","DOI":"10.18637\/jss.v081.c02"},{"key":"1906_CR5","unstructured":"Li, Y., Yu, W.: A fast implementation of singular value thresholding algorithm using recycling rank revealing randomized singular value decomposition. Preprint at arXiv:1704.05528 (2017)"},{"issue":"1","key":"1906_CR6","first-page":"1345","volume":"29","author":"KE Asnaoui","year":"2019","unstructured":"Asnaoui, K.E.: Image compression based on block svd power method. J. Intell. Syst. 29(1), 1345\u20131359 (2019)","journal-title":"J. Intell. Syst."},{"key":"1906_CR7","doi-asserted-by":"crossref","unstructured":"Erichson, N.B., Voronin, S., Brunton, S.L., Kutz, J.N.: Randomized matrix decompositions using R. J. Stat. Softw. 89(11) (2019)","DOI":"10.18637\/jss.v089.i11"},{"key":"1906_CR8","unstructured":"Ji, H., Yu, W., Li, Y.: A rank revealing randomized singular value decomposition (R3SVD) algorithm for low-rank matrix approximations. Preprint at arXiv:1605.08134 (2016)"},{"key":"1906_CR9","doi-asserted-by":"crossref","unstructured":"Narwaria, M., Lin, W.: Svd-based quality metric for image and video using machine learning. IEEE Trans. Syst. Man Cybern. Part B (Cybernetics) 42(2), 347\u2013364 (2011)","DOI":"10.1109\/TSMCB.2011.2163391"},{"key":"1906_CR10","unstructured":"Cherapanamjeri, Y., Jain, P., Netrapalli, P.: Thresholding based outlier robust PCA. In: Conference on Learning Theory, pp. 593\u2013628 (2017)"},{"key":"1906_CR11","volume-title":"Principal Component Analysis","author":"IT Jolliffe","year":"2010","unstructured":"Jolliffe, I.T.: Principal Component Analysis, 2nd edn. Springer Series in Statistics. Springer, New York (2010)","edition":"2"},{"key":"1906_CR12","unstructured":"Xu, H., Caramanis, C., Sanghavi, S.: Robust PCA via outlier pursuit. Advances in neural information processing systems, p. 23 (2010)"},{"key":"1906_CR13","volume-title":"Matrix Methods in Data Mining and Pattern Recognition","author":"L Eld\u00e9n","year":"2019","unstructured":"Eld\u00e9n, L.: Matrix Methods in Data Mining and Pattern Recognition. SIAM, Philadelphia (2019)"},{"issue":"18","key":"1906_CR14","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 genomewide expression data processing and modeling. Proc. Nat. Acad. Sci. 97(18), 10101\u201310106 (2000)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"1906_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-019-1900-3","volume":"21","author":"K Tsuyuzaki","year":"2020","unstructured":"Tsuyuzaki, K., Sato, H., Sato, K., Nikaido, I.: Benchmarking principal component analysis for large-scale single-cell RNA-sequencing. Genome Biol. 21, 1\u201317 (2020)","journal-title":"Genome Biol."},{"issue":"2","key":"1906_CR16","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. J. Soc. Ind. Appl. Math. Ser. B: Numer. Anal. 2(2), 205\u2013224 (1965)","journal-title":"J. Soc. Ind. Appl. Math. Ser. B: Numer. Anal."},{"key":"1906_CR17","first-page":"537","volume":"27","author":"RM Larsen","year":"1998","unstructured":"Larsen, R.M.: Lanczos bidiagonalization with partial reorthogonalization. DAIMI Rep. Ser. 27, 537 (1998)","journal-title":"DAIMI Rep. Ser."},{"issue":"1","key":"1906_CR18","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."},{"key":"1906_CR19","unstructured":"Lewis, B.W., Baglama, J., Reichel, L.: The irlba Package. https:\/\/cran.r-project.org\/web\/packages\/irlba (2021)"},{"issue":"5","key":"1906_CR20","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/16M1082214","volume":"39","author":"L Wu","year":"2017","unstructured":"Wu, L., Romero, E., Stathopoulos, A.: Primme svds: A high-performance pre-conditioned svd solver for accurate large-scale computations. SIAM J. Sci. Comput. 39(5), 248\u2013271 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"1906_CR21","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."},{"key":"1906_CR22","doi-asserted-by":"publisher","first-page":"101781","DOI":"10.1016\/j.softx.2024.101781","volume":"27","author":"X Feng","year":"2024","unstructured":"Feng, X., Yu, W., Xie, Y.: svds-c: A multi-thread C code for computing truncated singular value decomposition. SoftwareX 27, 101781 (2024)","journal-title":"SoftwareX"},{"key":"1906_CR23","unstructured":"Qiu, Y., Mei, J., Guennebaud, G., Niesen, J.: Rspectra: Solvers for large scale eigenvalue and svd problems. R version 0.16-0 (2019)"},{"key":"1906_CR24","doi-asserted-by":"publisher","unstructured":"Feng, X., Yu, W., Xie, Y., Tang, J.: Algorithm xxx: Faster randomized SVD with dynamic shifts. ACM Trans. Math. Softw. (TOMS) (2024). https:\/\/doi.org\/10.1145\/3660629. Just Accepted","DOI":"10.1145\/3660629"},{"key":"1906_CR25","unstructured":"Eaton, J.W., Bateman, D., Hauberg, S., Wehbring, R.: GNU Octave Version 8.4.0 Manual: A High-level Interactive Language for Numerical Computations. (2023). https:\/\/www.gnu.org\/software\/octave\/doc\/v8.4.0\/"},{"key":"1906_CR26","unstructured":"The Mathworks, I.: MATLAB (R2024a) SVDS. Natick, Massachusetts"},{"issue":"2","key":"1906_CR27","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s11075-016-0259-8","volume":"75","author":"E Onunwor","year":"2017","unstructured":"Onunwor, E., Reichel, L.: On the computation of a truncated SVD of a large linear discrete ill-posed problem. Numer. Algorithms 75(2), 359\u2013380 (2017)","journal-title":"Numer. Algorithms"},{"key":"1906_CR28","doi-asserted-by":"crossref","unstructured":"Feng, X., Yu, W.: A fast adaptive randomized pca algorithm. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, pp. 3695\u20133704 (2023)","DOI":"10.24963\/ijcai.2023\/411"},{"issue":"3","key":"1906_CR29","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1137\/17M1141977","volume":"39","author":"W Yu","year":"2018","unstructured":"Yu, W., Gu, Y., Li, Y.: Efficient randomized algorithms for the fixed-precision low-rank matrix approximation. SIAM J. Matrix Anal. Appl. 39(3), 1339\u20131359 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1906_CR30","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1553\/etna_vol58s164","volume":"58","author":"J Baglama","year":"2023","unstructured":"Baglama, J., Perovi\u0107, V.: Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods. Electron. Trans. Numer. Anal. 58, 164\u2013176 (2023)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"1906_CR31","doi-asserted-by":"crossref","unstructured":"Bentbib, A., Kanber, A.: Block power method for SVD decomposition. Analele \u015ftiin\u0163ifice ale Universit\u0103\u0163ii\u201d Ovidius\u201d Constan\u0163a. Ser. Matematic\u0103 23(2), 45\u201358 (2015)","DOI":"10.1515\/auom-2015-0024"},{"key":"1906_CR32","doi-asserted-by":"crossref","unstructured":"Sadek, R.A.: SVD based image processing applications: State of the art, contributions and research challenges. Int. J. Adv. Comput. Sci. Appl. 3(7) (2012)","DOI":"10.14569\/IJACSA.2012.030703"},{"issue":"2","key":"1906_CR33","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/12086755X","volume":"43","author":"C Boutsidis","year":"2014","unstructured":"Boutsidis, C., Drineas, P., Magdon-Ismail, M.: Near-optimal column-based matrix reconstruction. SIAM J. Sci. Comput. 43(2), 687\u2013717 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"1906_CR34","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 53, 285\u2013310 (2013)","journal-title":"BIT"},{"issue":"4","key":"1906_CR35","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1002\/nla.2048","volume":"23","author":"E Di Napoli","year":"2016","unstructured":"Di Napoli, E., Polizzi, E., Saad, Y.: Efficient estimation of eigenvalue counts in an interval. Numer. Linear Algebra Appl. 23(4), 674\u2013692 (2016)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"1","key":"1906_CR36","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. (TOMS) 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw. (TOMS)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01906-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01906-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01906-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T08:43:14Z","timestamp":1750149794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01906-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,6]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1906"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01906-9","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2024,8,6]]},"assertion":[{"value":"8 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}