{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T00:07:14Z","timestamp":1775088434728,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:00:00Z","timestamp":1752192000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:00:00Z","timestamp":1752192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2208294"],"award-info":[{"award-number":["DMS-2208294"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2038118"],"award-info":[{"award-number":["DMS-2038118"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2411197"],"award-info":[{"award-number":["DMS-2411197"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2038118"],"award-info":[{"award-number":["DMS-2038118"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11075-025-02167-w","type":"journal-article","created":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:34:41Z","timestamp":1752230081000},"page":"1965-1985","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Randomized and inner-product free Krylov methods for large-scale inverse problems"],"prefix":"10.1007","volume":"100","author":[{"given":"Malena","family":"Sabat\u00e9\u00a0Landman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariana N.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julianne","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James G.","family":"Nagy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,11]]},"reference":[{"key":"2167_CR1","doi-asserted-by":"publisher","unstructured":"Chung, J., Knepper, S., Nagy, J.G.: Large-scale inverse problems in imaging. In: Scherzer, O. (ed.) Handbook of Mathematical Methods in Imaging, pp. 47\u201390. Springer, New York, NY (2015). https:\/\/doi.org\/10.1007\/978-1-4939-0790-8_2","DOI":"10.1007\/978-1-4939-0790-8_2"},{"key":"2167_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718836","volume-title":"Discrete Inverse Problems: Insight and Algorithms","author":"PC Hansen","year":"2010","unstructured":"Hansen, P.C.: Discrete Inverse Problems: Insight and Algorithms. SIAM, Philadelphia (2010)"},{"key":"2167_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717570","volume-title":"Computational Methods for Inverse Problems","author":"CR Vogel","year":"2002","unstructured":"Vogel, C.R.: Computational Methods for Inverse Problems. SIAM, Philadelphia (2002)"},{"key":"2167_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/S0076-6895(02)80037-3","volume-title":"Geophysical Inverse Theory and Regularization Problems","author":"M Zhdanov","year":"2002","unstructured":"Zhdanov, M.: Geophysical Inverse Theory and Regularization Problems, vol. 36. Elsevier, New York (2002)"},{"key":"2167_CR5","unstructured":"Faddeev, D.K., Faddeeva, V.N.: Computational Methods of Linear Algebra. Freeman, San Francisco and London (1963). Translated by R.\u00a0C.\u00a0Williams"},{"key":"2167_CR6","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. Algor. 20, 303\u2013321 (1999)","journal-title":"Numer. Algor."},{"key":"2167_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10543-011-0365-x","volume":"52","author":"H Sadok","year":"2012","unstructured":"Sadok, H., Szyld, D.B.: A new look at CMRH and its relation to GMRES. BIT Numer. Math. 52, 485\u2013501 (2012). https:\/\/doi.org\/10.1007\/s10543-011-0365-x","journal-title":"BIT Numer. Math."},{"issue":"1","key":"2167_CR8","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1137\/24M1634874","volume":"46","author":"AN Brown","year":"2025","unstructured":"Brown, A.N., Sabat\u00e9 Landman, M., Nagy, J.G.: H-CMRH: An inner product free hybrid Krylov method for large-scale inverse problems. SIAM J. Matrix Anal. Appl. 46(1), 232\u2013255 (2025). https:\/\/doi.org\/10.1137\/24M1634874","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2167_CR9","doi-asserted-by":"crossref","unstructured":"Brown, A.N., Chung, J., Nagy, J.G., Sabat\u00e9 Landman, M.: Inner product free Krylov methods for large-scale inverse problems. arXiv:2409.05239 (2024)","DOI":"10.1137\/24M1672699"},{"issue":"1","key":"2167_CR10","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 Trans. Math. Softw. (TOMS) 8(1), 43\u201371 (1982)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"2","key":"2167_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/355993.356000","volume":"8","author":"CC Paige","year":"1982","unstructured":"Paige, C.C., Saunders, M.A.: Algorithm 583: LSQR: Sparse linear equations and least squares problems. ACM Trans. Math. Softw. (TOMS) 8(2), 195\u2013209 (1982)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"2167_CR12","doi-asserted-by":"publisher","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":"2167_CR13","volume-title":"An Introduction to Bayesian Scientific Computing: Ten Lectures on Subjective Computing","author":"D Calvetti","year":"2007","unstructured":"Calvetti, D., Somersalo, E.: An Introduction to Bayesian Scientific Computing: Ten Lectures on Subjective Computing, vol. 2. Springer, New York (2007)"},{"key":"2167_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0962492920000021","volume":"29","author":"P-G Martinsson","year":"2020","unstructured":"Martinsson, P.-G., Tropp, J.A.: Randomized numerical linear algebra: Foundations and algorithms. Acta Numerica 29, 403\u2013572 (2020). https:\/\/doi.org\/10.1017\/S0962492920000021","journal-title":"Acta Numerica"},{"key":"2167_CR15","doi-asserted-by":"publisher","unstructured":"Sarlos, T.: Improved approximation algorithms for large matrices via random projections. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 143\u2013152 (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.37","DOI":"10.1109\/FOCS.2006.37"},{"issue":"3","key":"2167_CR16","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/22M1518062","volume":"44","author":"S G\u00fcttel","year":"2023","unstructured":"G\u00fcttel, S., Schweitzer, M.: Randomized sketching for Krylov approximations of large-scale matrix functions. SIAM J. Matrix Anal. Appl. 44(3), 1073\u20131095 (2023). https:\/\/doi.org\/10.1137\/22M1518062","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2167_CR17","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1137\/20M138870X","volume":"44","author":"O Balabanov","year":"2022","unstructured":"Balabanov, O., Grigori, L.: Randomized Gram-Schmidt process with application to GMRES. SIAM J. Sci. Comput. 44(3), 1450\u20131474 (2022). https:\/\/doi.org\/10.1137\/20M138870X","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"2167_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1137\/120866580","volume":"36","author":"X Meng","year":"2014","unstructured":"Meng, X., Saunders, M.A., Mahoney, M.W.: LSRN: A parallel iterative solver for strongly over- or underdetermined systems. SIAM J. Sci. Comput. 36(2), 95\u2013118 (2014). https:\/\/doi.org\/10.1137\/120866580","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2167_CR19","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/090767911","volume":"32","author":"H Avron","year":"2010","unstructured":"Avron, H., Maymounkov, P., Toledo, S.: Blendenpik: Supercharging LAPACK\u2019s least-squares solver. SIAM J. Sci. Comput. 32(3), 1217\u20131236 (2010). https:\/\/doi.org\/10.1137\/090767911","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"2167_CR20","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1137\/23M1565413","volume":"45","author":"Y Nakatsukasa","year":"2024","unstructured":"Nakatsukasa, Y., Tropp, J.A.: Fast and accurate randomized algorithms for linear systems and eigenvalue problems. SIAM J. Matrix Anal. Appl. 45(2), 1183\u20131214 (2024). https:\/\/doi.org\/10.1137\/23M1565413","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2167_CR21","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. John Hopkins University Press, Baltimore (2013)","edition":"4"},{"issue":"2","key":"2167_CR22","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1137\/23M1551973","volume":"45","author":"M Meier","year":"2024","unstructured":"Meier, M., Nakatsukasa, Y., Townsend, A., Webb, M.: Are sketch-and-precondition least squares solvers numerically stable? SIAM J. Matrix Anal. Appl. 45(2), 905\u2013929 (2024). https:\/\/doi.org\/10.1137\/23M1551973","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2167_CR23","doi-asserted-by":"publisher","unstructured":"Sarlos, T.: Improved approximation algorithms for large matrices via random projections. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 143\u2013152 (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.37","DOI":"10.1109\/FOCS.2006.37"},{"key":"2167_CR24","doi-asserted-by":"crossref","unstructured":"Derezi\u0144ski, M., Mahoney, M.W.: Recent and upcoming developments in randomized numerical linear algebra for machine learning. In: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 6470\u20136479 (2024)","DOI":"10.1145\/3637528.3671461"},{"issue":"2","key":"2167_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","volume":"117","author":"P Drineas","year":"2011","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S., Sarl\u00f3s, T.: Faster least squares approximation. Numerische mathematik 117(2), 219\u2013249 (2011)","journal-title":"Faster least squares approximation. Numerische mathematik"},{"issue":"3","key":"2167_CR26","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s11075-018-0570-7","volume":"81","author":"S Gazzola","year":"2019","unstructured":"Gazzola, S., Hansen, P.C., Nagy, J.G.: IR Tools: a MATLAB package of iterative regularization methods and large-scale test problems. Numer. Algorithms 81(3), 773\u2013811 (2019). https:\/\/doi.org\/10.1007\/s11075-018-0570-7","journal-title":"Numer. Algorithms"},{"key":"2167_CR27","unstructured":"Bubba, T.A., Juvonen, M., Lehtonen, J., M\u00e4rz, M., Meaney, A., Purisha, Z., Siltanen, S.: Tomographic x-ray data of carved cheese. arXiv preprint arXiv:1705.05732 (2017)"},{"key":"2167_CR28","unstructured":"H\u00e4m\u00e4l\u00e4inen, K., Harhanen, L., Kallonen, A., Kujanp\u00e4\u00e4, A., Niemi, E., Siltanen, S.: Tomographic x-ray data of a walnut. arXiv preprint arXiv:1502.04064 (2015)"},{"key":"2167_CR29","doi-asserted-by":"crossref","unstructured":"Biguri, A., Sadakane, T., Lindroos, R., Liu, Y., Sabat\u00e9 Landman, M., Du, Y., Lohvithee, M., Kaser, S., Hatamikia, S., Bryll, R., Valat, E., Wonglee, S., Blumensath, T., Sch\u00f6nlieb, C.-B.: Tigre v3: Efficient and easy to use iterative computed tomographic reconstruction toolbox for real datasets. ArXiv preprint arXiv:2412.10129 (2024)","DOI":"10.1088\/2631-8695\/adbb3a"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02167-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02167-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02167-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T04:59:57Z","timestamp":1763960397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02167-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,11]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2167"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02167-w","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,11]]},"assertion":[{"value":"31 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2025","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interest"}}]}}