Emulation of a FMA and Correctly Rounded Sums: Proved Algorithms Using Rounding to Odd

DOI10.1109/TC.2007.70819zbMATH Open1388.65200OpenAlexW2116292260WikidataQ55967724 ScholiaQ55967724MaRDI QIDQ4589559FDOQ4589559

Authors: Sylvie Boldo, Guillaume Melquiond 

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

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited In (7)

• Some issues related to double rounding
• Floating-point arithmetic
• CPFloat: a C library for simulating low-precision arithmetic
• Verified compilation of floating-point computations
• Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods
• Reproducibility strategies for parallel preconditioned conjugate gradient
• Automatic exploration of reduced floating-point representations in iterative methods

This page was built for publication: Emulation of a FMA and Correctly Rounded Sums: Proved Algorithms Using Rounding to Odd

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589559)