Computationally Inequivalent Summations and Their Parenthetic Forms

05/11/2020
by   Laura Monroe, et al.
0

Floating-point addition on a finite-precision machine is not associative, so not all mathematically equivalent summations are computationally equivalent. Making this assumption can lead to numerical error in computations. Proper ordering and parenthesizing is a low-overhead way of mitigating such error in a floating point summation. Ordered and parenthesized summations fall into equivalence classes. We describe these classes, and the parenthetic forms summations in these classes take. We provide summation-related interpretations for sequences known in other contexts, and give new recursive and closed formulas for sequences not previously related to summation. We also introduce a data structure that facilitates understanding of these objects, and use it to consider certain forms of summation used by default in widely used computer languages. Finally, we relate this data structure to other mathematical constructs from the fields of mathematical analysis and algorithmic analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2016

Vectorization of Multibyte Floating Point Data Formats

We propose a scheme for reduced-precision representation of floating poi...
research
09/20/2021

Solving systems of inequalities in two variables with floating point arithmetic

From a theoretical point of view, finding the solution set of a system o...
research
05/07/2018

Combining Tools for Optimization and Analysis of Floating-Point Computations

Recent renewed interest in optimizing and analyzing floating-point progr...
research
03/29/2022

Precision-aware Deterministic and Probabilistic Error Bounds for Floating Point Summation

We analyze the forward error in the floating point summation of real num...
research
07/14/2022

Sound Randomized Smoothing in Floating-Point Arithmetics

Randomized smoothing is sound when using infinite precision. However, we...
research
09/08/2019

Accurate Computation of the Log-Sum-Exp and Softmax Functions

Evaluating the log-sum-exp function or the softmax function is a key ste...
research
03/03/2023

Automating Constraint-Aware Datapath Optimization using E-Graphs

Numerical hardware design requires aggressive optimization, where design...

Please sign up or login with your details

Forgot password? Click here to reset