Error Bounds on Complex Floating-Point Multiplication (original) (raw)

Article Dans Une Revue Mathematics of Computation Année : 2007

Résumé

Given floating-point arithmetic with ttt-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 z0z_0z0 and z1z_1z1 can be computed with maximum absolute error absz0absz1frac12beta1−tsqrt5\abs{z_0} \abs{z_1} \frac{1}{2} \beta^{1 - t} \sqrt{5}absz_0absz_1frac12beta1−tsqrt5. In particular, this provides relative error bounds of 2−24sqrt52^{-24} \sqrt{5}2−24sqrt5 and 2−53sqrt52^{-53} \sqrt{5}2−53sqrt5 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.

Domaines

Connectez-vous pour contacter le contributeur

https://inria.hal.science/inria-00120352

Soumis le : mardi 19 décembre 2006-14:04:38

Dernière modification le : mercredi 18 mars 2026-11:52:02

Archivage à long terme le : vendredi 25 novembre 2016-13:27:47

Dates et versions

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

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

Licence

Identifiants

Citer

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

623 Consultations

712 Téléchargements