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

DOI10.1109/TC.2007.70819MaRDI QIDQ4589559zbMATH OpenOpenAlexWikidataFDO

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

(10)

• 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
• Verified compilation of floating-point computations
• Some issues related to double rounding
• Automatic exploration of reduced floating-point representations in iterative methods
• Floating-point arithmetic
• CPFloat: a C library for simulating low-precision arithmetic
• Emulation of the FMA and the correctly-rounded sum of three numbers in rounding-to-nearest floating-point arithmetic
• Mixed-Precision Computing for Scientific Discovery: Formats, Co-Design, and Responsible Approximation
• A Branch-Free General Renormalization Scheme for Pair Arithmetic and Its Performance Evaluation

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)