On accurate floating-point summation
From MaRDI portal
Publication:5633648
DOI10.1145/362854.362889zbMath0226.68020OpenAlexW2048504605MaRDI QIDQ5633648
Publication date: 1971
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/362854.362889
Symbolic computation and algebraic computation (68W30) Numerical solutions to equations with linear operators (65J10)
Related Items (7)
Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods ⋮ Floating-point arithmetic ⋮ Additive preconditioning and aggregation in matrix computations ⋮ Summation of imprecise numbers ⋮ Fast interval matrix multiplication ⋮ A new error-free floating-point summation algorithm ⋮ Analysis of some known methods of improving the accuracy of floating-point sums
This page was built for publication: On accurate floating-point summation
