Analysis of some known methods of improving the accuracy of floating-point sums
From MaRDI portal
Publication:4768558
DOI10.1007/BF01932946zbMATH Open0282.65034MaRDI QIDQ4768558FDOQ4768558
Authors: Seppo Linnainmaa
Publication date: 1974
Published in: BIT (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A floating-point technique for extending the available precision
- Title not available (Why is that?)
- On accurate floating-point summation
- Reducing truncation errors by programming
- Accurate floating-point summation
- Quasi double-precision in floating point addition
- Improving round-off in Runge-Kutta computations with Gill's method
- Title not available (Why is that?)
- The performance of a system for automatic segmentation of programs within an ALGOL compiler (GIER ALGOL)
- A comparison of floating point summation methods
- On the representation of zero in floating-point arithmetic
Cited In (6)
- Towards accurate statistical estimation of rounding errors in floating-point computations
- The factorability of symmetric matrices and some implications for statistical linear models
- Accurate floating-point summation: a new approach
- Error bounds on complex floating-point multiplication with an FMA
- Evading the drift in floating-point addition
- Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating
This page was built for publication: Analysis of some known methods of improving the accuracy of floating-point sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4768558)