A new error-free floating-point summation algorithm
From MaRDI portal
Publication:1029843
DOI10.1016/j.camwa.2008.09.051zbMath1165.65301OpenAlexW2082349392MaRDI QIDQ1029843
Brian Murphy, Guoliang Qian, Rhys Eric Rosholt, Pan, Victor Y.
Publication date: 13 July 2009
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2008.09.051
Related Items (3)
Solving linear systems of equations with randomization, augmentation and aggregation ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating
Uses Software
Cites Work
- Additive preconditioning, eigenspaces, and the inverse iteration
- Schur aggregation for linear systems and determinants
- Additive preconditioning and aggregation in matrix computations
- A floating-point technique for extending the available precision
- Accurate and Efficient Floating Point Summation
- Accuracy and Stability of Numerical Algorithms
- Design, implementation and testing of extended and mixed precision BLAS
- On accurate floating-point summation
- Accurate Sum and Dot Product
This page was built for publication: A new error-free floating-point summation algorithm