Efficient minimization of numerical summation errors

DOI10.1007/BFB0055068MaRDI QIDQ4219033zbMATH OpenFDO

Authors Ming-Yang Kao, Jie Wang

Publication date 19 April 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0055068

zbMATH Keywords

floating point prefix set summationfloating-point set summationlinear-time approximation algorithmminimum worst-case errorpolynomial-time approximation algorithm

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Roundoff error (65G50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
• Accurate and Efficient Floating Point Summation
• On Floating-Point Summation

Cited in

(6)

• Estimation of denormalization errors
• Best “ordering” for floating-point addition
• Minimization of rounding errors algebraically by use of coding theory
• A Novel Approach for the Efficient Computation of 1-D and 2-D Summations
• Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
• Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees

This page was built for publication: Efficient minimization of numerical summation errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4219033)