Algorithms for Efficient Reproducible Floating Point Summation

DOI10.1145/3389360zbMath1484.65100OpenAlexW3041643290WikidataQ113309933 ScholiaQ113309933MaRDI QIDQ5132335

Peter Ahrens, Hong Diep Nguyen, James W. Demmel

Publication date: 10 November 2020

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3389360

zbMATH Keywords

summationparallelreproducibilitycomputer arithmeticfloating point summationfloating point numberbinned numberbinned summationreproducible summation

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical summation of series (65B10)

Related Items (5)

Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem ⋮ Floating-point arithmetic ⋮ Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors ⋮ Parallel vectorized implementations of compensated summation algorithms ⋮ Efficiency of Reproducible Level 1 BLAS

Uses Software

• CUBLAS
• MKL
• ExBLAS

This page was built for publication: Algorithms for Efficient Reproducible Floating Point Summation