On the Computation of Correctly Rounded Sums

DOI10.1109/TC.2011.27MaRDI QIDQ5277636zbMATH OpenFDO

Authors Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller

Publication date 12 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2011.27

Mathematics Subject Classification ID

Roundoff error (65G50)

Recommendations

• Correct rounding and a hybrid approach to exact floating-point summation
• Correctly Rounded Arbitrary-Precision Floating-Point Summation
• On rounding error sums related to the circle problem
• Accurate Floating-Point Summation Part I: Faithful Rounding
• scientific article; zbMATH DE number 4039134
• On Floating-Point Summation
• Computing a correct and tight rounding error bound using rounding-to-nearest
• The Accuracy of Floating Point Summation
• Correctly Rounded Multiplication by Arbitrary Precision Constants
• scientific article; zbMATH DE number 3548453

Cited in

(11)

• Formal verification of a floating-point expansion renormalization algorithm
• The true order of magnitude of Lamé rounding error sums
• Correct approximation of IEEE 754 floating-point arithmetic for program verification
• Computing predecessor and successor in rounding to nearest
• scientific article; zbMATH DE number 4039133 (Why is no real title available?)
• Correctly Rounded Multiplication by Arbitrary Precision Constants
• Innocuous Double Rounding of Basic Arithmetic Operations
• Correct rounding of algebraic functions
• Primitive Floats in Coq
• Floating-point arithmetic
• Emulation of the FMA and the correctly-rounded sum of three numbers in rounding-to-nearest floating-point arithmetic

This page was built for publication: On the Computation of Correctly Rounded Sums

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