Skip to Main content Skip to Navigation
New interface
Journal articles

Error Bounds on Complex Floating-Point Multiplication

Richard P. Brent Colin Percival Paul Zimmermann 1 
1 CACAO - Curves, Algebra, Computer Arithmetic, and so On
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Paul Zimmermann Connect in order to contact the contributor
Submitted on : Tuesday, December 19, 2006 - 2:04:38 PM
Last modification on : Friday, February 4, 2022 - 3:30:50 AM
Long-term archiving on: : Friday, November 25, 2016 - 1:27:47 PM


Files produced by the author(s)


  • HAL Id : inria-00120352, version 2



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



Record views


Files downloads