Average Error: 0.0 → 0.0
Time: 3.7s
Precision: 64
\[x.re \cdot y.im + x.im \cdot y.re\]
↓
\[\mathsf{fma}\left(x.im, y.re, x.re \cdot y.im\right)\]
x.re \cdot y.im + x.im \cdot y.re
↓
\mathsf{fma}\left(x.im, y.re, x.re \cdot y.im\right)
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2059293 = x_re;
        double r2059294 = y_im;
        double r2059295 = r2059293 * r2059294;
        double r2059296 = x_im;
        double r2059297 = y_re;
        double r2059298 = r2059296 * r2059297;
        double r2059299 = r2059295 + r2059298;
        return r2059299;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r2059300 = x_im;
        double r2059301 = y_re;
        double r2059302 = x_re;
        double r2059303 = y_im;
        double r2059304 = r2059302 * r2059303;
        double r2059305 = fma(r2059300, r2059301, r2059304);
        return r2059305;
}

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(x.im, y.re, x.re \cdot y.im\right)}\]

  5. Final simplification0.0

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

Reproduce

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