A Distillation Algorithm for Floating-Point Summation
From MaRDI portal
Recommendations
- A New Distillation Algorithm for Floating-Point Summation
- Algorithms for efficient reproducible floating point summation
- Accurate floating-point summation: a new approach
- A new error-free floating-point summation algorithm
- Accurate and Efficient Floating Point Summation
- Precision-aware deterministic and probabilistic error bounds for floating point summation
- scientific article; zbMATH DE number 3850378
- scientific article; zbMATH DE number 878996
- scientific article; zbMATH DE number 3682957
- Toward Accurate and Fast Summation
Cited in
(12)- Introducing SummerTime: a package for high-precision computation of sums appearing in DRA method
- Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods
- Optimal inverse projection of floating-point addition
- Numerical validation of compensated summation algorithms with stochastic arithmetic
- Line segment intersection testing
- Algorithm 908
- scientific article; zbMATH DE number 3682957 (Why is no real title available?)
- On Floating-Point Summation
- scientific article; zbMATH DE number 878996 (Why is no real title available?)
- Analysis and applications of Priest's distillation
- A New Distillation Algorithm for Floating-Point Summation
- Bayesian fractional polynomials
This page was built for publication: A Distillation Algorithm for Floating-Point Summation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4253089)
