Error Bounds on Complex Floating-Point Multiplication - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematics of Computation Year : 2007

Error Bounds on Complex Floating-Point Multiplication

Richard P. Brent
  • Function : Author
Colin Percival
  • Function : Author

Abstract

Given floating-point arithmetic with $t$-digit base-$\beta$ significands in which all arithmetic operations are performed as if calculated to infinite precision and rounded to a nearest representable value, we prove that the product of complex values $z_0$ and $z_1$ can be computed with maximum absolute error $\abs{z_0} \abs{z_1} \frac{1}{2} \beta^{1 - t} \sqrt{5}$. In particular, this provides relative error bounds of $2^{-24} \sqrt{5}$ and $2^{-53} \sqrt{5}$ for {IEEE 754} single and double precision arithmetic respectively, provided that overflow, underflow, and denormals do not occur. We also provide the numerical worst cases for {IEEE 754} single and double precision arithmetic.
Fichier principal
Vignette du fichier
squelette-rr.pdf (289.09 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00120352 , version 1 (18-12-2006)
inria-00120352 , version 2 (19-12-2006)

Identifiers

  • HAL Id : inria-00120352 , version 2

Cite

Richard P. Brent, Colin Percival, Paul Zimmermann. Error Bounds on Complex Floating-Point Multiplication. Mathematics of Computation, 2007, 76, pp.1469-1481. ⟨inria-00120352v2⟩
302 View
248 Download

Share

Gmail Mastodon Facebook X LinkedIn More