{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T18:03:35Z","timestamp":1780423415219,"version":"3.54.1"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,5,28]],"date-time":"2027-05-28T00:00:00Z","timestamp":1811462400000},"content-version":"am","delay-in-days":361,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000015","name":"US Department of Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.parco.2026.103197","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T16:13:24Z","timestamp":1779466404000},"page":"103197","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Random sketching to enhance the numerical stability of block orthogonalization algorithms for s-step GMRES"],"prefix":"10.1016","volume":"128","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-7248-573X","authenticated-orcid":false,"given":"Ichitaro","family":"Yamazaki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew J.","family":"Higgins","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik G.","family":"Boman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel B.","family":"Szyld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.parco.2026.103197_b1","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/0907058","article-title":"GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems","volume":"7","author":"Saad","year":"1986","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/j.parco.2026.103197_b2","series-title":"Communication-avoiding Krylov subspace methods in theory and practice","author":"Carson","year":"2015"},{"key":"10.1016\/j.parco.2026.103197_b3","series-title":"Communication-avoiding Krylov subspace methods","author":"Hoemmen","year":"2010"},{"key":"10.1016\/j.parco.2026.103197_b4","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0168-9274(95)00079-A","article-title":"Reducing the effect of global communication in GMRES(m) and CG on parallel distributed memory computers","volume":"18","author":"de Sturler","year":"1995","journal-title":"Appl. Numer. Math."},{"key":"10.1016\/j.parco.2026.103197_b5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1080\/00207169208804108","article-title":"Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation","volume":"44","author":"Joubert","year":"1992","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/j.parco.2026.103197_b6","doi-asserted-by":"crossref","unstructured":"I. Yamazaki, A.J. Higgins, E.G. Boman, D.B. Szyld, Two-Stage Block Orthogonalization to Improve Performance of s-step GMRES, in: Proceedings of the IEEE International Parallel and Distributed Processing Symposium, IPDPS, 2024, pp. 26\u201337.","DOI":"10.1109\/IPDPS57955.2024.00012"},{"issue":"3","key":"10.1016\/j.parco.2026.103197_b7","doi-asserted-by":"crossref","first-page":"1487","DOI":"10.1137\/23M1605387","article-title":"Reorthogonalized block classical Gram\u2013Schmidt using two cholesky-based TSQR algorithms","volume":"45","author":"Barlow","year":"2024","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.parco.2026.103197_b8","doi-asserted-by":"crossref","first-page":"2165","DOI":"10.1137\/S1064827500370883","article-title":"A block orthogonalization procedure with constant synchronization requirements","volume":"23","author":"Stathopoulos","year":"2002","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.parco.2026.103197_b9","series-title":"Randomized cholesky QR factorizations","author":"Balabanov","year":"2022"},{"key":"10.1016\/j.parco.2026.103197_b10","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1007\/s00211-025-01492-5","article-title":"Analysis of randomized householder-cholesky QR factorization with multisketching","volume":"157","author":"Higgins","year":"2025","journal-title":"Numer. Math."},{"key":"10.1016\/j.parco.2026.103197_b11","series-title":"Integrating Random sketching into BCGS2 for s-step GMRES","author":"Yamazaki","year":"2024"},{"key":"10.1016\/j.parco.2026.103197_b12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0400000060","article-title":"Sketching as a tool for numerical linear algebra","volume":"10","author":"Woodruff","year":"2014","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"10.1016\/j.parco.2026.103197_b13","doi-asserted-by":"crossref","DOI":"10.1145\/3802822","article-title":"Trilinos: Enabling scientific computing across diverse hardware architectures at scale","author":"Mayr","year":"2026","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/j.parco.2026.103197_b14","unstructured":"The Trilinos Project Team, The Trilinos Project Website. URL https:\/\/trilinos.github.io."},{"issue":"1","key":"10.1016\/j.parco.2026.103197_b15","doi-asserted-by":"crossref","first-page":"A553","DOI":"10.1137\/22M1518396","article-title":"Randomized block Gram\u2013Schmidt process for the solution of linear systems and eigenvalue problems","volume":"47","author":"Balabanov","year":"2025","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"10.1016\/j.parco.2026.103197_b16","doi-asserted-by":"crossref","first-page":"A1450","DOI":"10.1137\/20M138870X","article-title":"Randomized gram-Schmidt process with application to GMRES","volume":"44","author":"Balabanov","year":"2022","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.parco.2026.103197_b17","series-title":"Randomized orthogonal projection methods for Krylov subspace solvers","author":"Timsit","year":"2023"},{"key":"10.1016\/j.parco.2026.103197_b18","doi-asserted-by":"crossref","first-page":"A206","DOI":"10.1137\/080731992","article-title":"Communication-optimal parallel and sequential QR and LU factorizations","volume":"34","author":"Demmel","year":"2012","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.parco.2026.103197_b19","doi-asserted-by":"crossref","unstructured":"M. Anderson, G. Ballard, J. Demmel, K. Keutzer, Communication-Avoiding QR Decomposition for GPUs, in: Proceedings of the IEEE International Parallel and Distributed Processing Symposium, IPDPS, 2011.","DOI":"10.1109\/IPDPS.2011.15"},{"key":"10.1016\/j.parco.2026.103197_b20","doi-asserted-by":"crossref","unstructured":"T. Mary, I. Yamazaki, J. Kurzak, P. Luszczek, S. Tomov, J. Dongarra, Performance of random sampling for computing low-rank approximations of a dense matrix on GPUs, in: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2015, pp. 60:1\u201360:11.","DOI":"10.1145\/2807591.2807613"},{"key":"10.1016\/j.parco.2026.103197_b21","unstructured":"K. Swirydowicz, Random Sketching for Improving the Performance of Gram-Schmidt Algorithm on Modern Architectures. Talk presented at the 2023 SIAM Conference on Computational Science and Engineering, Amsterdam, February 27\u2013March 3, 2013."},{"key":"10.1016\/j.parco.2026.103197_b22","series-title":"On the numerical stability of sketched GMRES","author":"Burke","year":"2025"},{"issue":"3","key":"10.1016\/j.parco.2026.103197_b23","doi-asserted-by":"crossref","first-page":"2008","DOI":"10.1137\/24M1690485","article-title":"On the backward stability of s-step GMRES","volume":"46","author":"Carson","year":"2025","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.parco.2026.103197_b24","series-title":"Fast & accurate randomized algorithms for linear systems and eigenvalue problems","author":"Nakatsukasa","year":"2021"},{"key":"10.1016\/j.parco.2026.103197_b25","doi-asserted-by":"crossref","unstructured":"T. Sarlos, Improved Approximation Algorithms for Large Matrices via Random Projections, in: Proceedings of the Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2006, pp. 143\u2013152.","DOI":"10.1109\/FOCS.2006.37"},{"key":"10.1016\/j.parco.2026.103197_b26","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1017\/S0962492920000021","article-title":"Randomized numerical linear algebra: Foundations and algorithms","volume":"29","author":"Martinsson","year":"2020","journal-title":"Acta Numer."},{"issue":"4","key":"10.1016\/j.parco.2026.103197_b27","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1093\/imanum\/14.4.563","article-title":"A Newton basis GMRES implementation","volume":"14","author":"Bai","year":"1994","journal-title":"IMA J. Numer. Anal."},{"key":"10.1016\/j.parco.2026.103197_b28","doi-asserted-by":"crossref","unstructured":"M. Mohiyuddin, M. Hoemmen, J. Demmel, K. Yelick, Minimizing communication in sparse matrix solvers, in: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2009, pp. 36:1\u201336:12.","DOI":"10.1145\/1654059.1654096"},{"key":"10.1016\/j.parco.2026.103197_b29","doi-asserted-by":"crossref","first-page":"C217","DOI":"10.1137\/130930376","article-title":"Communication Avoiding ILU0 Preconditioner","volume":"37","author":"Grigori","year":"2015","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.parco.2026.103197_b30","doi-asserted-by":"crossref","unstructured":"I. Yamazaki, S. Rajamanickam, E. Boman, M. Hoemmen, M. Heroux, S. Tomov, Domain Decomposition Preconditioners for Communication-avoiding Krylov Methods on a Hybrid CPU-GPU Cluster, in: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2014, pp. 933\u2013944.","DOI":"10.1109\/SC.2014.81"},{"key":"10.1016\/j.parco.2026.103197_b31","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1137\/21M1394424","article-title":"The stability of block variants of classical gram\u2013Schmidt","volume":"42","author":"Carson","year":"2021","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.parco.2026.103197_b32","first-page":"306","article-title":"Roundoff error analysis of the cholesky QR2 algorithm","volume":"44","author":"Yamamoto","year":"2015","journal-title":"Electron. Trans. Numer. Anal."},{"key":"10.1016\/j.parco.2026.103197_b33","first-page":"306","article-title":"Roundoff error analysis of the cholesky QR2 algorithm","volume":"44","author":"Yamamoto","year":"2015","journal-title":"Electron. Trans. Numer. Anal."},{"key":"10.1016\/j.parco.2026.103197_b34","article-title":"Low rank approximation and regression in input sparsity time","volume":"63","author":"Clarkson","year":"2018","journal-title":"J. ACM"},{"key":"10.1016\/j.parco.2026.103197_b35","doi-asserted-by":"crossref","unstructured":"I. Yamazaki, S.J. Thomas, M. Hoemmen, E.G. Boman, K. Swirydowicz, J.J. Elliott, Low-synchronization orthogonalization schemes for s-step and pipelined Krylov solvers in Trilinos, in: Proceedings of the of SIAM Conference on Parallel Processing for Scientific Computing, 2020, pp. 118\u2013128.","DOI":"10.1137\/1.9781611976137.11"},{"key":"10.1016\/j.parco.2026.103197_b36","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s00211-006-0042-1","article-title":"A note on the error analysis of classical gram-Schmidt","volume":"105","author":"Smoktunowicz","year":"2006","journal-title":"Numer. Math."},{"issue":"2","key":"10.1016\/j.parco.2026.103197_b37","article-title":"Tpetra, and the use of generic programming in scientific computing","volume":"20","author":"Baker","year":"2012","journal-title":"Sci. Program."},{"key":"10.1016\/j.parco.2026.103197_b38","unstructured":"The Tpetra Project Team, The Tpetra Project Website. URL https:\/\/trilinos.github.io\/tpetra.html."},{"key":"10.1016\/j.parco.2026.103197_b39","series-title":"Kokkos Kernels: Performance portable sparse\/dense linear algebra and graph kernels","author":"Rajamanickam","year":"2021"},{"key":"10.1016\/j.parco.2026.103197_b40","doi-asserted-by":"crossref","unstructured":"A.J. Higgins, E. Boman, I. Yamazaki, A High Performance GPU CountSketch Implementation and Its Application to Multisketching and Least Squares Problems, in: Proceedings of the Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC Workshops), 2025, pp. 1808\u20131815.","DOI":"10.1145\/3731599.3767544"},{"key":"10.1016\/j.parco.2026.103197_b41","series-title":"Accuracy and Stability of Numerical Algorithms","author":"Higham","year":"2002"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819126000153?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819126000153?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T17:29:30Z","timestamp":1780421370000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819126000153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":41,"alternative-id":["S0167819126000153"],"URL":"https:\/\/doi.org\/10.1016\/j.parco.2026.103197","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Random sketching to enhance the numerical stability of block orthogonalization algorithms for -step GMRES","name":"articletitle","label":"Article Title"},{"value":"Parallel Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.parco.2026.103197","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103197"}}