On relative errors of floating-point operations: optimal bounds and applications
From MaRDI portal
Publication:4600709
DOI10.1090/MCOM/3234zbMATH Open1380.65082OpenAlexW2292537122MaRDI QIDQ4600709FDOQ4600709
Authors: Claude-Pierre Jeannerod, Siegfried M. Rump 
Publication date: 12 January 2018
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00934443/file/JeannerodRump2016.pdf
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- Improved error bounds for inner products in floating-point arithmetic
- Improved backward error bounds for LU and Cholesky factorizations
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Error bounds on complex floating-point multiplication
- Accurate Sum and Dot Product
- Error analysis of floating-point computation
- A floating-point technique for extending the available precision
- Error bounds on complex floating-point multiplication with an FMA
- Implementing complex elementary functions using exception handling
- Midpoints and Exact Points of Some Algebraic Functions in Floating-Point Arithmetic
Cited In (34)
- Formally-verified round-off error analysis of Runge-Kutta methods
- Further analysis of Kahan's algorithm for the accurate computation of \(2\times 2\) determinants
- Improved estimates for error in floating point representation analysis
- Floating-point arithmetic
- A radix-independent error analysis of the Cornea-Harrison-Tang method
- On the error of computing \(ab+cd\) using Cornea, Harrison and Tang's method
- Improved error bounds for floating-point products and Horner's scheme
- On the definition of unit roundoff
- Accurate calculation of Euclidean norms using double-word arithmetic
- Primitive Floats in Coq
- A priori worst case error bounds for floating-point computations
- Faithfully rounded floating-point computations
- On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic
- IEEE-754 precision-\(p\) base-\(\beta\) arithmetic implemented in binary
- Fast and accurate computation of the Euclidean norm of a vector
- Enabling floating-point arithmetic in the Coq proof assistant
- A \(p\times p\) bit fraction model of binary floating point division and extremal rounding cases.
- Title not available (Why is that?)
- Automatic forward error analysis for floating point algorithms
- Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations
- Precision-aware deterministic and probabilistic error bounds for floating point summation
- Exploiting structure in floating-point arithmetic
- Sharp error bounds for complex floating-point inversion
- Some models of relative error in products
- Relative error in floating-point multiplication
- Efficient calculation of the joint distribution of order statistics
- The relative accuracy of \(\mathtt{(x+y)*(x-y)}\)
- Computing a correct and tight rounding error bound using rounding-to-nearest
- A fast parallel high-precision summation algorithm based on AccSumK
- Zur Division mit Rest auf Gleitkommarechnern. (Division with remainder on floating point computers)
- Error bounds on complex floating-point multiplication with an FMA
- Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic”
- Expressive power of ReLU and step networks under floating-point operations
- A reduced product of absolute and relative error bounds for floating-point analysis
Uses Software
This page was built for publication: On relative errors of floating-point operations: optimal bounds and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600709)
