Accurate floating-point summation

DOI10.1145/362384.362498MaRDI QIDQ5606949zbMATH OpenOpenAlexFDO

Authors Peter Linz

Publication date 1970

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/362384.362498

Mathematics Subject Classification ID

Roundoff error (65G50)

Cited in

(12)

• All possible computed results in correct floating-point summation
• Summation of imprecise numbers
• On iterative refinement of triangular linear algebraic systems
• Optimal simulation lengths for various algorithms computing the mean
• Line segment intersection testing
• The impact of data distribution in accuracy and performance of parallel linear algebra subroutines
• Roundoff errors in floating-point summation
• Propagation of initial rounding error in Romberg-like quadrature
• Analysis of some known methods of improving the accuracy of floating-point sums
• Implementation of a low round-off summation method
• Rounding error using low precision approximate random variables
• A generalized Kahan-Babuška-summation-algorithm

This page was built for publication: Accurate floating-point summation

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