{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T08:03:02Z","timestamp":1776931382907,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,16]]},"DOI":"10.1145\/3731599.3767542","type":"proceedings-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T16:18:44Z","timestamp":1762532324000},"page":"1779-1789","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Numerical Properties and Scalability of s-Step Preconditioned Conjugate Gradient Methods"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2214-7301","authenticated-orcid":false,"given":"Viktoria","family":"Mayer","sequence":"first","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Vienna, Austria and UniVie Doctoral School Computer Science DoCS, University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5170-1251","authenticated-orcid":false,"given":"Wilfried N.","family":"Gansterer","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,15]]},"reference":[{"key":"e_1_3_3_1_2_2","unstructured":"Erin Carson. 2015. Communication-Avoiding Krylov Subspace Methods in Theory and Practice. Ph.\u00a0D. Dissertation. EECS Department University of California Berkeley."},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","unstructured":"Erin Carson. 2018. The Adaptive s-Step Conjugate Gradient Method. SIAM J. Matrix Anal. Appl. 39 3 (2018) 1318\u20131338. 10.1137\/16M1107942","DOI":"10.1137\/16M1107942"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Erin Carson and James Demmel. 2014. A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of s-Step Krylov Subspace Methods. SIAM J. Matrix Anal. Appl. 35 1 (2014) 22\u201343. 10.1137\/120893057","DOI":"10.1137\/120893057"},{"key":"e_1_3_3_1_5_2","unstructured":"Erin Carson Nicholas Knight and James Demmel. 2014. An efficient deflation technique for the communication-avoiding conjugate gradient method. Electronic transactions on numerical analysis ETNA 43 (2014) 125\u2013141."},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"Erin\u00a0C. Carson Tom\u00e1s Gergelits and Ichitaro Yamazaki. 2022. Mixed precision s-step Lanczos and conjugate gradient algorithms. Numerical Linear Algebra with Applications 29 3 (2022) e2425.","DOI":"10.1002\/nla.2425"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","unstructured":"Tyler Chen and Erin\u00a0C. Carson. 2020. Predict-and-recompute conjugate gradient variants. SIAM Journal on Scientific Computing 42 5 (2020) A3084\u2013A3108. arXiv:https:\/\/arXiv.org\/abs\/1905.0154910.1137\/19m1276856","DOI":"10.1137\/19m1276856"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Anthony\u00a0T. Chronopoulos and C.\u00a0William Gear. 1989. On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy. Parallel Comput. 11 1 (1989) 37\u201353. 10.1016\/0167-8191(89)90062-8","DOI":"10.1016\/0167-8191(89)90062-8"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Anthony\u00a0T. Chronopoulos and C.\u00a0William Gear. 1989. s-step iterative methods for symmetric linear systems. J. Comput. Appl. Math. 25 2 (1989) 153\u2013168. 10.1016\/0377-0427(89)90045-9","DOI":"10.1016\/0377-0427(89)90045-9"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Siegfried Cools Jeffrey Cornelis and Wim Vanroose. 2019. Numerically Stable Recurrence Relations for the Communication Hiding Pipelined Conjugate Gradient Method. IEEE Transactions on Parallel and Distributed Systems 30 11 (2019) 2507\u20132522. 10.1109\/TPDS.2019.2917663","DOI":"10.1109\/TPDS.2019.2917663"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","unstructured":"Timothy\u00a0A. Davis and Yifan Hu. 2011. The University of Florida Sparse Matrix Collection. ACM Trans. Math. Software 38 1 Article 1 (2011) 25\u00a0pages. 10.1145\/2049662.2049663","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_3_1_12_2","volume-title":"Avoiding Communication in Computing Krylov Subspaces","author":"Demmel James","year":"2007","unstructured":"James Demmel, Mark\u00a0F. Hoemmen, Marghoob Mohiyuddin, and Katherine\u00a0A. Yelick. 2007. Avoiding Communication in Computing Krylov Subspaces. Technical Report UCB\/EECS-2007-123. EECS Department, University of California, Berkeley."},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Pieter Ghysels and Wim Vanroose. 2014. Hiding global synchronization latency in the preconditioned Conjugate Gradient algorithm. Parallel Comput. 40 7 (2014) 224\u2013238. 10.1016\/j.parco.2013.06.0017th Workshop on Parallel Matrix Algorithms and Applications.","DOI":"10.1016\/j.parco.2013.06.001"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Martin Gutknecht and Zdenvek Strakos. 2000. Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers. SIAM J. Matrix Anal. Appl. 22 1 (2000) 213\u2013229. 10.1137\/S0895479897331862","DOI":"10.1137\/S0895479897331862"},{"key":"e_1_3_3_1_15_2","unstructured":"Mark\u00a0F. Hoemmen. 2010. Communication-avoiding Krylov subspace methods. Ph.\u00a0D. Dissertation. EECS Department University of California Berkeley."},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ScalA.2018.00006"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/ScalA.2016.007"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7224-92"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003.ch4"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC50609.2020.00029"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/Cluster48925.2021.00061"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.5555\/922039"},{"key":"e_1_3_3_1_23_2","volume-title":"The Trilinos Project Website","author":"Team The Trilinos\u00a0Project","year":"2025","unstructured":"The Trilinos\u00a0Project Team. 2025 (acccessed July 29, 2025). The Trilinos Project Website. https:\/\/trilinos.github.io"}],"event":{"name":"SC Workshops '25: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis","location":"St Louis MO USA","acronym":"SC Workshops '25","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the SC '25 Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3731599.3767542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:31:31Z","timestamp":1767987091000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3731599.3767542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,15]]},"references-count":22,"alternative-id":["10.1145\/3731599.3767542","10.1145\/3731599"],"URL":"https:\/\/doi.org\/10.1145\/3731599.3767542","relation":{},"subject":[],"published":{"date-parts":[[2025,11,15]]},"assertion":[{"value":"2025-11-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}