Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic
From MaRDI portal
Publication:4581373
Recommendations
- Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic”
- Tight Error Analysis in Fixed-Point Arithmetic
- Tight Error Analysis in Fixed-point Arithmetic
- Bit-precise verification of discontinuity errors under fixed-point arithmetic
- scientific article; zbMATH DE number 1206068
- Bounds and trade-offs for double-base number systems
- On the complexity of computing error bounds
- Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates
- Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
- On Lower Bounds for Constant Width Arithmetic Circuits
Cited in
(6)- Mixed precision algorithms in numerical linear algebra
- Floating-point arithmetic
- Accurate calculation of Euclidean norms using double-word arithmetic
- On bound of a large number annihilating a small number in addition operation of two numbers with same sign: numerical experiment
- Enclosing Chebyshev expansions in linear time
- Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic”
This page was built for publication: Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581373)
