Error bounds on complex floating-point multiplication

  • Brent R
  • Percival C
  • Zimmermann P
27Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Given floating-point arithmetic with t-digit base-β 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 |z_0||z_1|1/2β^{1−t}√5. In particular, this provides relative error bounds of 2^{−24}√5 and 2^{−53}√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.

Cite

CITATION STYLE

APA

Brent, R., Percival, C., & Zimmermann, P. (2007). Error bounds on complex floating-point multiplication. Mathematics of Computation, 76(259), 1469–1482. https://doi.org/10.1090/s0025-5718-07-01931-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free