Error bounds on complex floating-point multiplication with an FMA
From MaRDI portal
Publication:2953212
DOI10.1090/mcom/3123zbMath1355.65063OpenAlexW2296909587MaRDI QIDQ2953212
Nicolas Louvet, Claude-Pierre Jeannerod, Peter Kornerup, Jean-Michel Muller
Publication date: 4 January 2017
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3123
Related Items
Floating-point arithmetic, On relative errors of floating-point operations: Optimal bounds and applications, The relative accuracy of \(\mathtt{(x+y)*(x-y)}\), A Radix-Independent Error Analysis of the Cornea-Harrison-Tang Method
Uses Software
Cites Work
- A floating-point technique for extending the available precision
- Correction d'une somme en arithmétique à virgule flottante
- Error bounds on complex floating-point multiplication
- Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms
- Handbook of Floating-Point Arithmetic
- Software for Doubled-Precision Floating-Point Computations
- Analysis of some known methods of improving the accuracy of floating-point sums
- Accuracy and Stability of Numerical Algorithms
- On the Error of Computing ab + cd using Cornea, Harrison and Tang's Method
- A Radix-Independent Error Analysis of the Cornea-Harrison-Tang Method
- Further analysis of Kahan’s algorithm for the accurate computation of $2\times 2$ determinants
- Quasi double-precision in floating point addition
