{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T09:12:53Z","timestamp":1780045973288,"version":"3.53.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"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. Math."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s00211-025-01492-5","type":"journal-article","created":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T10:11:15Z","timestamp":1757326275000},"page":"1695-1737","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of Randomized Householder-Cholesky QR factorization with multisketching"],"prefix":"10.1007","volume":"157","author":[{"given":"Andrew J.","family":"Higgins","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel B.","family":"Szyld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik G.","family":"Boman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ichitaro","family":"Yamazaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,8]]},"reference":[{"key":"1492_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66, 671\u2013687 (2003). (Special Issue on PODS 2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"1492_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J.W., Dongarra, J.J., Croz, J.D., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.C.: LAPACK Users\u2019 Guide. Society for Industrial and Applied Mathematics, Philadelphia, Third edition, (1999)","DOI":"10.1137\/1.9780898719604"},{"key":"1492_CR3","unstructured":"Balabanov, O., Grigori, L.: Randomized block Gram\u2013Schmidt process for solution of linear systems and eigenvalue problems, (2023). arXiv:2111.14641. Accessed 21 June 2023"},{"key":"1492_CR4","unstructured":"Balabanov, O.: Randomized Cholesky QR factorizations, (2022). arXiv:2210.09953. Accessed 21 June 2023"},{"key":"1492_CR5","doi-asserted-by":"publisher","first-page":"A1450","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, A1450\u2013A1474 (2022)","journal-title":"SIAM J. Sci. Comput."},{"key":"1492_CR6","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.jpdc.2014.07.003","volume":"74","author":"H Carter Edwards","year":"2014","unstructured":"Carter Edwards, H., Trott, C.R., Sunderland, D.: Kokkos: enabling manycore performance portability through polymorphic memory access patterns. J. Parallel Distrib. Comput 74, 3202\u20133216 (2014)","journal-title":"J. Parallel Distrib. Comput"},{"key":"1492_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science. CALP 2002. pp 693\u2013703. Springer, Berlin, Heidelberg (2002).","DOI":"10.1007\/3-540-45465-9_59"},{"key":"1492_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0377-0427(89)90045-9","volume":"25","author":"AT Chronopoulos","year":"1989","unstructured":"Chronopoulos, A.T., William Gear, C.: s-step iterative methods for symmetric linear systems. J. Comput. Appl. Math. 25, 153\u2013168 (1989)","journal-title":"J. Comput. Appl. Math."},{"key":"1492_CR9","doi-asserted-by":"publisher","first-page":"A206","DOI":"10.1137\/080731992","volume":"34","author":"JW Demmel","year":"2012","unstructured":"Demmel, J.W., Grigori, L., Hoemmen, M., Langou, J.: Communication-optimal parallel and sequential QR and LU factorizations. SIAM J. Sci. Comput. 34, A206\u2013A239 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"1492_CR10","unstructured":"Fan, Y., Guo, Y., Lin, T.: A novel randomized XR-based preconditioned CholeskyQR algorithm (2021). arXiv:2111.11148. Accessed 21 June 2023"},{"key":"1492_CR11","doi-asserted-by":"crossref","unstructured":"Fukaya, T., Nakatsukasa, Y., Yanagisawa, Y., Yamamoto, Y.: CholeskyQR2: A simple and communication-avoiding algorithm for computing a tall-skinny QR factorization on a large-scale parallel system. In: 2014 5th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems. IEEE Computer Society, Los Alamitos. pp  31-38  (2014)","DOI":"10.1109\/ScalA.2014.11"},{"issue":"1","key":"1492_CR12","doi-asserted-by":"publisher","first-page":"A477","DOI":"10.1137\/18M1218212","volume":"42","author":"T Fukaya","year":"2020","unstructured":"Fukaya, T., Kannan, R., Nakatsukasa, Y., Yamamoto, Y., Yanagisawa, Y.: Shifted Cholesky QR for computing the QR factorization of ill-conditioned matrices. SIAM J. Sci. Comput. 42(1), A477\u2013A503 (2020)","journal-title":"SIAM J. Sci. Comput."},{"key":"1492_CR13","unstructured":"George, E.: Forsythe and Cleve B. Moler. Computer Solution of Linear Algebraic Systems. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"1492_CR14","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1137\/140989492","volume":"37","author":"L Grigori","year":"2016","unstructured":"Grigori, L., Moufawad, S., Nataf, F.: Enlarged Krylov subspace conjugate gradient methods for reducing communication. SIAM J. Matrix Anal. Appl. 37, 744\u2013773 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1492_CR15","unstructured":"Gutknecht, M.H.: Block Krylov subspace methods for linear systems with multiple right-hand sides: An introduction. In: Siddiqi, A.H., Duff, I.S., Christensen, O. (eds.) Modern Mathematical Models, Methods and Algorithms for Real World Systems, chapter\u00a010. Anamaya Publishers, New Dehli. pp 420\u2013447 (2006)"},{"key":"1492_CR16","doi-asserted-by":"crossref","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms. Society for Industrial and Applied Mathematics, Second edition. Philadelphia (2002)","DOI":"10.1137\/1.9780898718027"},{"key":"1492_CR17","unstructured":"Hoemmen, M.: Communication-avoiding Krylov subspace methods. PhD thesis, EECS Department, University of California, Berkeley (2010)"},{"key":"1492_CR18","unstructured":"Kapralov, M., Potluru, V., Woodruff, D.: How to fake multiply by a Gaussian matrix. In: Balcan, M.F., Weinberger, K.Q. (eds.) Proceedings of The 33rd International Conference on Machine Learning, vol.\u00a048. Proceedings of Machine Learning Research. pp. 2101\u20132110. (2016)"},{"key":"1492_CR19","doi-asserted-by":"crossref","unstructured":"Meng, X., Mahoney, M.W.: Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC \u201913, page 91-100. Association for Computing Machinery, New York (2013)","DOI":"10.1145\/2488608.2488621"},{"key":"1492_CR20","unstructured":"Nakatsukasa, Y., Tropp, J.A.: Fast & accurate randomized algorithms for linear systems and eigenvalue problems (2021). arXiv:2111.00113. Accessed 21 June 2023"},{"key":"1492_CR21","unstructured":"NVIDIA. cuBLAS documentation. https:\/\/docs.nvidia.com\/cuda\/cublas\/index.html. Accessed: 2023-06-21"},{"key":"1492_CR22","unstructured":"NVIDIA. CUDA toolkit documentation. https:\/\/docs.nvidia.com\/cuda\/. Accessed: 2023-06-21"},{"key":"1492_CR23","unstructured":"NVIDIA. cuSOLVER documentation. https:\/\/docs.nvidia.com\/cuda\/cusolver\/index.html. Accessed: 2023-06-21"},{"key":"1492_CR24","unstructured":"NVIDIA. cuSPARSE documentation. https:\/\/docs.nvidia.com\/cuda\/cusparse\/index.html. Accessed: 2023-06-21"},{"key":"1492_CR25","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0024-3795(80)90247-5","volume":"29","author":"DP O\u2019Leary","year":"1980","unstructured":"O\u2019Leary, D.P.: The block conjugate gradient algorithm and related methods. Linear Algebra Appl. 29, 293\u2013322 (1980)","journal-title":"Linear Algebra Appl."},{"key":"1492_CR26","unstructured":"Rajamanickam, S., Acer, S., Berger-Vergiat, L., Dang, V.Q., Ellingwood, N.D., Harvey, E., Kelley, B., Trott, C.R., Wilke, J.J., Yamazaki, I.: Kokkos kernels: Performance portable sparse\/dense linear algebra and graph kernels (2021). arxiv:2103.11991. Accessed 21 June 2023"},{"key":"1492_CR27","doi-asserted-by":"publisher","first-page":"13212","DOI":"10.1073\/pnas.0804869105","volume":"105","author":"V Rokhlin","year":"2008","unstructured":"Rokhlin, V., Tygert, M.: A fast randomized algorithm for overdetermined linear least-squares regression. Proc. Natl. Acad. Sci. U.S.A. 105, 13212\u201313217 (2008)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"1492_CR28","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s, T.: Improved approximation algorithms for large matrices via random projections. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 143\u2013152. IEEE Computer Society, Los Alamitos (2006)","DOI":"10.1109\/FOCS.2006.37"},{"key":"1492_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/20M1314471","volume":"42","author":"A Sobczyk","year":"2021","unstructured":"Sobczyk, A., Gallopoulos, E.: Estimating leverage scores via rank revealing methods and randomization. SIAM J. Matrix Anal. Appl. 42, 199\u20131228 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1492_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3555370","volume":"48","author":"A Sobczyk","year":"2022","unstructured":"Sobczyk, A., Gallopoulos, E.: pylspack: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores. ACM Trans. Math. Softw. 48, 1\u201327 (2022)","journal-title":"ACM Trans. Math. Softw."},{"key":"1492_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596","volume-title":"High-dimensional probability: an introduction with applications in data science. Cambridge series in statistical and probabilistic mathematics","author":"R Vershynin","year":"2018","unstructured":"Vershynin, R.: High-dimensional probability: an introduction with applications in data science. Cambridge series in statistical and probabilistic mathematics. Cambridge University Press, Cambridge (2018)"},{"key":"1492_CR32","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/0909010","volume":"9","author":"HF Walker","year":"1988","unstructured":"Walker, H.F.: Implementation of the GMRES method using Householder transformations. SIAM J. Sci. Stat. Comput. 9, 152\u2013163 (1988)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"1492_CR33","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BF01456804","volume":"71","author":"H Weyl","year":"1912","unstructured":"Weyl, H.: Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung). Math. Ann. 71, 441\u2013479 (1912)","journal-title":"Math. Ann."},{"key":"1492_CR34","volume-title":"The algebraic Eigenvalue problem","author":"JH Wilkinson","year":"1965","unstructured":"Wilkinson, J.H.: The algebraic Eigenvalue problem. Oxford University Press, Oxford (1965)"},{"key":"1492_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000060","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Found. Trends. Theor. Comput. Sci. 10, 1\u2013157 (2014)","journal-title":"Found. Trends. Theor. Comput. Sci."},{"key":"1492_CR36","first-page":"306","volume":"44","author":"Y Yamamoto","year":"2015","unstructured":"Yamamoto, Y., Nakatsukasa, Y., Yanagisawa, Y., Fukaya, T.: Roundoff error analysis of the Cholesky QR2 algorithm. Electron. Trans. Numer. Anal. 44, 306\u2013326 (2015)","journal-title":"Electron. Trans. Numer. Anal."}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-025-01492-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00211-025-01492-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-025-01492-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T04:04:01Z","timestamp":1760501041000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00211-025-01492-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1492"],"URL":"https:\/\/doi.org\/10.1007\/s00211-025-01492-5","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"11 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2025","order":4,"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 Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}