{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T21:03:38Z","timestamp":1744232618199,"version":"3.38.0"},"reference-count":29,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T00:00:00Z","timestamp":1698192000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p> Parallel implementations of Krylov subspace methods often help to accelerate the procedure of finding an approximate solution of a linear system. However, such parallelization coupled with asynchronous and out-of-order execution often makes more visible the non-associativity impact in floating-point operations. These problems are even amplified when communication-hiding pipelined algorithms are used to improve the parallelization of Krylov subspace methods. Introducing reproducibility in the implementations avoids these problems by getting more robust and correct solutions. This paper proposes a general framework for deriving reproducible and accurate variants of Krylov subspace methods. The proposed algorithmic strategies are reinforced by programmability suggestions to assure deterministic and accurate executions. The framework is illustrated on the preconditioned BiCGStab method and its pipelined modification, which in fact is a distinctive method from the Krylov subspace family, for the solution of non-symmetric linear systems with message-passing. Finally, we verify the numerical behavior of the two reproducible variants of BiCGStab on a set of matrices from the SuiteSparse Matrix Collection and a 3D Poisson\u2019s equation. <\/jats:p>","DOI":"10.1177\/10943420231207642","type":"journal-article","created":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T13:08:50Z","timestamp":1698239330000},"page":"17-33","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["General framework for re-assuring numerical reliability in parallel Krylov solvers: A case of bi-conjugate gradient stabilized methods"],"prefix":"10.1177","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2414-700X","authenticated-orcid":false,"given":"Roman","family":"Iakymchuk","sequence":"first","affiliation":[{"name":"Ume\u00e5 University, Ume\u00e5, Sweden"},{"name":"Uppsala University, Uppsala, Sweden"}]},{"given":"Stef","family":"Graillat","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8469-764X","authenticated-orcid":false,"given":"Jos\u00e9 I.","family":"Aliaga","sequence":"additional","affiliation":[{"name":"Universitat Jaime I, Castell\u00f3n de la Plana, Spain"}]}],"member":"179","published-online":{"date-parts":[[2023,10,25]]},"reference":[{"key":"bibr1-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971538"},{"key":"bibr2-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.09.001"},{"key":"bibr3-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2017.04.005"},{"key":"bibr4-10943420231207642","first-page":"163","volume":"21","author":"Demmel J","year":"2013","journal-title":"Proceedings of ARITH-"},{"key":"bibr5-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2345391"},{"key":"bibr6-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0080116"},{"key":"bibr7-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1145\/1236463.1236468"},{"key":"bibr8-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1145\/103162.103163"},{"key":"bibr9-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2001.930115"},{"key":"bibr10-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027"},{"key":"bibr11-10943420231207642","unstructured":"Iakymchuk R, Collange S, Defour D, et al. (2015) ExBLAS: reproducible and accurate BLAS library. In: Proceedings of the NRE2015 Workshop Held as Part of SC15, Austin, TX, USA, 15\u201320 November 2015. pp. 1\u20134."},{"key":"bibr12-10943420231207642","first-page":"1","volume":"1","author":"Iakymchuk R","year":"2019","journal-title":"IJHPCA"},{"key":"bibr15-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30442-2_2"},{"key":"bibr13-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1177\/1094342020932650"},{"key":"bibr14-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2019.112697"},{"key":"bibr17-10943420231207642","unstructured":"Knuth DE (1969) The Art of Computer Programming: Seminumerical Algorithms. Reading: Addison-Wesley, 2."},{"key":"bibr18-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-010-0127-7"},{"key":"bibr19-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43229-4_44"},{"key":"bibr20-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2015.28"},{"key":"bibr21-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1137\/030601818"},{"key":"bibr22-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-011-9478-1"},{"key":"bibr23-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1137\/07068816X"},{"key":"bibr24-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1587\/nolta.1.2"},{"key":"bibr25-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"bibr26-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1137\/0907058"},{"key":"bibr27-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1137\/0910004"},{"key":"bibr28-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1137\/0913035"},{"key":"bibr29-10943420231207642","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2018.12.006"},{"key":"bibr16-10943420231207642","unstructured":"IEEE Computer Society (2008) IEEE Standard for Floating-Point Arithmetic. IEEE Standard 754-2008. pp 1-70, 2008. https:\/\/ieeexplore.ieee.org\/document\/4610935"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420231207642","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/10943420231207642","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420231207642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T05:29:09Z","timestamp":1740979749000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/10943420231207642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,25]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["10.1177\/10943420231207642"],"URL":"https:\/\/doi.org\/10.1177\/10943420231207642","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2023,10,25]]}}}