Average Error: 0.0 → 0.0
Time: 1.0s
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 r48436 = x_re;
        double r48437 = y_im;
        double r48438 = r48436 * r48437;
        double r48439 = x_im;
        double r48440 = y_re;
        double r48441 = r48439 * r48440;
        double r48442 = r48438 + r48441;
        return r48442;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r48443 = y_re;
        double r48444 = x_im;
        double r48445 = y_im;
        double r48446 = x_re;
        double r48447 = r48445 * r48446;
        double r48448 = fma(r48443, r48444, r48447);
        return r48448;
}

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 2020059 +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)))