Tight Error Analysis in Fixed-point Arithmetic
From MaRDI portal
Recommendations
- Tight Error Analysis in Fixed-Point Arithmetic
- scientific article; zbMATH DE number 1206081
- Rigorous error analysis of numerical algorithms via symbolic computations
- Bit-precise verification of discontinuity errors under fixed-point arithmetic
- Numerical analysis of fixed point algorithms in the presence of hardware faults
- Numerical accuracy control in fixed-point arithmetic
- scientific article; zbMATH DE number 3864502
- An error bound for fixed-point iterations
- A reduced product of absolute and relative error bounds for floating-point analysis
Cited in
(10)- Fast and efficient bit-level precision tuning
- A Priori Error Analysis and Spring Arithmetic
- scientific article; zbMATH DE number 1206068 (Why is no real title available?)
- Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic
- Bit-precise verification of discontinuity errors under fixed-point arithmetic
- Tight Error Analysis in Fixed-Point Arithmetic
- A new approach to efficient and secure fixed-point computation
- Rigorous error analysis of numerical algorithms via symbolic computations
- Formalization of fixed-point arithmetic in HOL
- Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics
This page was built for publication: Tight Error Analysis in Fixed-point Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6177466)