Average Error: 0.0 → 0.0
Time: 794.0ms
Precision: 64
\[x.re \cdot y.im + x.im \cdot y.re\]
↓
\[\mathsf{fma}\left(y.re, x.im, y.im \cdot x.re\right)\]
x.re \cdot y.im + x.im \cdot y.re
↓
\mathsf{fma}\left(y.re, x.im, y.im \cdot x.re\right)
double f(double x_re, double x_im, double y_re, double y_im) {
        double r82359 = x_re;
        double r82360 = y_im;
        double r82361 = r82359 * r82360;
        double r82362 = x_im;
        double r82363 = y_re;
        double r82364 = r82362 * r82363;
        double r82365 = r82361 + r82364;
        return r82365;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r82366 = y_re;
        double r82367 = x_im;
        double r82368 = y_im;
        double r82369 = x_re;
        double r82370 = r82368 * r82369;
        double r82371 = fma(r82366, r82367, r82370);
        return r82371;
}

Error

Bits error versus x.re

Bits error versus x.im

Bits error versus y.re

Bits error versus y.im

Derivation

  1. Initial program 0.0

    \[x.re \cdot y.im + x.im \cdot y.re\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(x.re, y.im, x.im \cdot y.re\right)}\]

  3. Taylor expanded around inf 0.0

    \[\leadsto \color{blue}{y.re \cdot x.im + y.im \cdot x.re}\]

  4. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(y.re, x.im, y.im \cdot x.re\right)}\]

  5. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(y.re, x.im, y.im \cdot x.re\right)\]

Reproduce

herbie shell --seed 2020060 +o rules:numerics
(FPCore (x.re x.im y.re y.im)
  :name "_multiplyComplex, imaginary part"
  :precision binary64
  (+ (* x.re y.im) (* x.im y.re)))