Average Error: 0.0 → 0.0
Time: 1.2s
Precision: 64
\[x.re \cdot y.im + x.im \cdot y.re\]
↓
\[\mathsf{fma}\left(x.re, y.im, x.im \cdot y.re\right)\]
x.re \cdot y.im + x.im \cdot y.re
↓
\mathsf{fma}\left(x.re, y.im, x.im \cdot y.re\right)
double f(double x_re, double x_im, double y_re, double y_im) {
        double r109282 = x_re;
        double r109283 = y_im;
        double r109284 = r109282 * r109283;
        double r109285 = x_im;
        double r109286 = y_re;
        double r109287 = r109285 * r109286;
        double r109288 = r109284 + r109287;
        return r109288;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r109289 = x_re;
        double r109290 = y_im;
        double r109291 = x_im;
        double r109292 = y_re;
        double r109293 = r109291 * r109292;
        double r109294 = fma(r109289, r109290, r109293);
        return r109294;
}

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. Final simplification0.0

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

Reproduce

herbie shell --seed 2019326 +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)))