A Refined Probabilistic Error Bound for Sums
Abstract
This paper considers a probabilistic model for floating-point computation in which the roundoff errors are represented by bounded random variables with mean zero. Using this model, a probabilistic bound is derived for the forward error of the computed sum of n real numbers. This work improves upon existing probabilistic bounds by holding to all orders, and as a result provides informative bounds for larger problem sizes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.