A generalized Kahan-Babuška-summation-algorithm
From MaRDI portal
(Redirected from Publication:817033)
The author presents a combination of recursive and balancing summation techniques for floating numbers, to yield a high precision summation algorithm. He also shows how to modify balancing algorithms to identify guaranteed upper and lower bounds for the sum of floating point numbers with application in interval arithmetic.
Recommendations
Cites work
- A floating-point technique for extending the available precision
- Accurate floating-point summation
- Accurate Sum and Dot Product
- Error analysis of floating-point computation
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Implementation of a low round-off summation method
- Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
- Rundungsfehleranalyse einiger Verfahren zur Summation endlicher Summen
- The Accuracy of Floating Point Summation
Cited in
(9)- An implementation of Karr's summation algorithm in Mathematica
- A numerically robust, parallel-friendly variant of BiCGstab for the semi-implicit integration of the viscous term in smoothed particle hydrodynamics
- Biot-Savart routines with minimal floating point error
- scientific article; zbMATH DE number 3860391 (Why is no real title available?)
- Accuracy Improvements for Single Precision Implementations of the SPH Method
- Further analysis of Kahan's algorithm for the accurate computation of \(2\times 2\) determinants
- Analysis and applications of Priest's distillation
- A New Distillation Algorithm for Floating-Point Summation
- Rounding error using low precision approximate random variables
This page was built for publication: A generalized Kahan-Babuška-summation-algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817033)