Accurate floating-point summation
From MaRDI portal
Publication:5606949
DOI10.1145/362384.362498zbMath0206.46102OpenAlexW2076087297MaRDI QIDQ5606949
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
Related Items
All possible computed results in correct floating-point summation ⋮ Implementation of a low round-off summation method ⋮ Summation of imprecise numbers ⋮ Roundoff errors in floating-point summation ⋮ Propagation of initial rounding error in Romberg-like quadrature ⋮ On iterative refinement of triangular linear algebraic systems ⋮ Optimal simulation lengths for various algorithms computing the mean ⋮ The Impact of Data Distribution in Accuracy and Performance of Parallel Linear Algebra Subroutines ⋮ Line segment intersection testing ⋮ Analysis of some known methods of improving the accuracy of floating-point sums ⋮ A generalized Kahan-Babuška-summation-algorithm
This page was built for publication: Accurate floating-point summation
