Accurate and Efficient Floating Point Summation
From MaRDI portal
Publication:4442520
DOI10.1137/S1064827502407627zbMath1061.65039MaRDI QIDQ4442520
Publication date: 20 January 2004
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
algorithmsnumerical examplesfloating point numbersroundoff errordistillationaccurate summationdot productdouble-extended precision
Related Items (20)
Mixed precision algorithms in numerical linear algebra ⋮ Schur aggregation for linear systems and determinants ⋮ Minimizing synchronizations in sparse iterative solvers for distributed supercomputers ⋮ On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots ⋮ Precision-aware deterministic and probabilistic error bounds for floating point summation ⋮ Error‐free transformation of matrix multiplication with a posteriori validation ⋮ Matrix computations and polynomial root-finding with preprocessing ⋮ Additive preconditioning and aggregation in matrix computations ⋮ More accuracy at fixed precision. ⋮ Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic ⋮ Computing singular values of diagonally dominant matrices to high relative accuracy ⋮ Multiple-Precision Correctly rounded Newton-Cotes quadrature ⋮ Estimating the number of stable configurations for the generalized Thomson problem ⋮ On ergodic and mixing properties of the triangle map ⋮ Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating ⋮ A new error-free floating-point summation algorithm ⋮ Line segment intersection testing ⋮ Improvement of error-free splitting for accurate matrix multiplication
Uses Software
This page was built for publication: Accurate and Efficient Floating Point Summation
