Average Error: 0.0 → 0.0
Time: 970.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 r45462 = x_re;
        double r45463 = y_im;
        double r45464 = r45462 * r45463;
        double r45465 = x_im;
        double r45466 = y_re;
        double r45467 = r45465 * r45466;
        double r45468 = r45464 + r45467;
        return r45468;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r45469 = y_re;
        double r45470 = x_im;
        double r45471 = y_im;
        double r45472 = x_re;
        double r45473 = r45471 * r45472;
        double r45474 = fma(r45469, r45470, r45473);
        return r45474;
}

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