Probabilistic Error Analysis for Inner Products

06/25/2019
by   Ilse C. F. Ipsen, et al.
0

Probabilistic models are proposed for bounding the forward error in the numerically computed inner product (dot product, scalar product) between of two real n-vectors. We derive probabilistic perturbation bounds, as well as probabilistic roundoff error bounds for the sequential accumulation of the inner product. These bounds are non-asymptotic, explicit, and make minimal assumptions on perturbations and roundoffs. The perturbations are represented as independent, bounded, zero-mean random variables, and the probabilistic perturbation bound is based on Azuma's inequality. The roundoffs are also represented as bounded, zero-mean random variables. The first probabilistic bound assumes that the roundoffs are independent, while the second one does not. For the latter, we construct a Martingale that mirrors the sequential order of computations. Numerical experiments confirm that our bounds are more informative, often by several orders of magnitude, than traditional deterministic bounds -- even for small vector dimensions n and very stringent success probabilities. In particular the probabilistic roundoff error bounds are functions of √(n) rather than n, thus giving a quantitative confirmation of Wilkinson's intuition. The paper concludes with a critical assessment of the probabilistic approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/13/2021

A Refined Probabilistic Error Bound for Sums

This paper considers a probabilistic model for floating-point computatio...
research
01/27/2021

Probabilistic Error Analysis For Sequential Summation of Real Floating Point Numbers

We derive two probabilistic bounds for the relative forward error in the...
research
04/09/2021

Householder orthogonalization with a non-standard inner product

Householder orthogonalization plays an important role in numerical linea...
research
07/21/2022

Stochastic rounding variance and probabilistic bounds: A new approach *

Stochastic rounding (SR) offers an alternative to the deterministic IEEE...
research
10/22/2020

Sharper convergence bounds of Monte Carlo Rademacher Averages through Self-Bounding functions

We derive sharper probabilistic concentration bounds for the Monte Carlo...
research
10/24/2017

Explicit error bounds for lattice Edgeworth expansions

Motivated, roughly, by comparing the mean and median of an IID sum of bo...
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...

Please sign up or login with your details

Forgot password? Click here to reset