On roundoff error distributions in floating point and logarithmic arithmetic
From MaRDI portal
Publication:761018
DOI10.1007/BF02251833zbMath0556.65036OpenAlexW90649232MaRDI QIDQ761018
E. H. Bareiss, Jesse L. Barlow
Publication date: 1985
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02251833
comparisonroundoff errorsinner productsfloating point arithmeticsumsProbabilistic modelserror confidence intervalslogarithmic arithmetic
Related Items (8)
On a law of the iterated logarithm for sums mod 1 with application to Benford's law ⋮ Overflow and underflow in multiplication and division ⋮ A basic theory of Benford's law ⋮ First digit law from Laplace transform ⋮ Probabilistic Error Analysis for Inner Products ⋮ Number shortening algorithms ⋮ Gradual and tapered overflow and underflow: A functional differential equation and its approximation ⋮ Remarks on Gödel’s code as a hash function
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic error analysis of Gaussian elimination in floating point and logarithmic arithmetic
- Round-off error in products
- Effect of guard digits and normalization options on floating point multiplication
- On the Distribution of First Significant Digits
- Further Revelations on L.S.D.
- Beyond Floating Point
- Improved Trailing Digits Estimates Applied to Optimal Computer Arithmetic
- Loss of Significance in Floating Point Subtraction and Addition
- The Distribution of Leading Significant Digits
- Convergence Estimates for the Distribution of Trailing Digits
- On the Probability that a Random Integer has Initial Digit A
- On the Distribution of First Significant Figures
- On the Distribution of Numbers
This page was built for publication: On roundoff error distributions in floating point and logarithmic arithmetic