HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

General framework for deriving reproducible Krylov subspace algorithms: A BiCGStab case study

Abstract : Parallel implementations of Krylov subspace algorithms often help to accelerate the procedure to find the solution of a linear system. However, from the other side, such parallelization coupled with asynchronous and out-of-order execution often enlarge the non-associativity of floating-point operations. This results in non-reproducibility on the same or different settings. This paper proposes a general framework for deriving reproducible and accurate variants of a Krylov subspace algorithm. The proposed algorithmic strategies are reinforced by programmability suggestions to assure deterministic and accurate executions. The framework is illustrated on the preconditioned BiCGStab method for the solution of non-symmetric linear systems in parallel environments with message-passing. Finally, we verify the two reproducible variants of PBiCGStab on a set matrices from the SuiteSparse Matrix Collection.
Complete list of metadata

Contributor : Roman Iakymchuk Connect in order to contact the contributor
Submitted on : Monday, October 18, 2021 - 10:14:14 AM
Last modification on : Tuesday, January 4, 2022 - 5:51:19 AM
Long-term archiving on: : Wednesday, January 19, 2022 - 6:56:14 PM


Files produced by the author(s)


  • HAL Id : hal-03382119, version 1


Roman Iakymchuk, Stef Graillat, José Aliaga. General framework for deriving reproducible Krylov subspace algorithms: A BiCGStab case study. 2021. ⟨hal-03382119⟩



Record views


Files downloads