Emulation of a FMA and Correctly Rounded Sums: Proved Algorithms Using Rounding to Odd
From MaRDI portal
Publication:4589559
DOI10.1109/TC.2007.70819zbMath1388.65200OpenAlexW2116292260WikidataQ55967724 ScholiaQ55967724MaRDI QIDQ4589559
Guillaume Melquiond, Sylvie Boldo
Publication date: 10 November 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2007.70819
Related Items
Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods, Floating-point arithmetic, Some issues related to double rounding, Automatic Exploration of Reduced Floating-Point Representations in Iterative Methods, Reproducibility strategies for parallel preconditioned conjugate gradient, Verified compilation of floating-point computations