Mostrar el registro sencillo del ítem
General Framework for Deriving Reproducible Krylov Subspace Algorithms: BiCGStab Case
dc.contributor.author | Iakymchuk, Roman | |
dc.contributor.author | Graillat, Stef | |
dc.contributor.author | Aliaga Estellés, José Ignacio | |
dc.date.accessioned | 2023-12-21T13:39:56Z | |
dc.date.available | 2023-12-21T13:39:56Z | |
dc.date.issued | 2023 | |
dc.identifier.citation | IAKYMCHUK, Roman; GRAILLAT, Stef; ALIAGA, José I. General Framework for Deriving Reproducible Krylov Subspace Algorithms: BiCGStab Case. En International Conference on Parallel Processing and Applied Mathematics. Cham: Springer International Publishing, 2022. p. 16-29. | ca_CA |
dc.identifier.isbn | 978-3-031-30441-5 | |
dc.identifier.isbn | 978-3-031-30442-2 | |
dc.identifier.uri | http://hdl.handle.net/10234/205258 | |
dc.description.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 with message-passing. Finally, we verify the two reproducible variants of PBiCGStab on a set matrices from the SuiteSparse Matrix Collection and a 3D Poisson’s equation. | ca_CA |
dc.format.extent | 12 p. | ca_CA |
dc.format.mimetype | application/pdf | ca_CA |
dc.language.iso | eng | ca_CA |
dc.publisher | Springer | ca_CA |
dc.relation.isPartOf | International Conference on Parallel Processing and Applied Mathematics | ca_CA |
dc.rights | © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023 R. Wyrzykowski et al. (Eds.): PPAM 2022, LNCS 13826, pp. 16–29, 2023. https://doi.org/10.1007/978-3-031-30442-2_2 | ca_CA |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | ca_CA |
dc.subject | Reproducibility | ca_CA |
dc.subject | accuracy | ca_CA |
dc.subject | floating-point expansion | ca_CA |
dc.subject | long accumulator | ca_CA |
dc.subject | fused multiply-add | ca_CA |
dc.subject | preconditioned BiCGStab | ca_CA |
dc.title | General Framework for Deriving Reproducible Krylov Subspace Algorithms: BiCGStab Case | ca_CA |
dc.type | info:eu-repo/semantics/bookPart | ca_CA |
dc.identifier.doi | https://doi.org/10.1007/978-3-031-30442-2_2 | |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca_CA |
dc.relation.publisherVersion | https://link.springer.com/chapter/10.1007/978-3-031-30442-2_2 | ca_CA |
dc.type.version | info:eu-repo/semantics/acceptedVersion | ca_CA |
project.funder.name | Agencia Estatal de Investigación | ca_CA |
project.funder.name | European Union’s Horizon 2020 | ca_CA |
oaire.awardNumber | PID2020- 113656RB-C21 | ca_CA |
oaire.awardNumber | MCIN/AEI/10.13039/501100011033 | ca_CA |
oaire.awardNumber | ANR-20-CE46-0009 | ca_CA |
oaire.awardNumber | info:eu-repo/grantAgreement/EC/H2020/842528 | ca_CA |