Average Error: 0.0 → 0.0
Time: 5.1s
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 r1790758 = x_re;
        double r1790759 = y_im;
        double r1790760 = r1790758 * r1790759;
        double r1790761 = x_im;
        double r1790762 = y_re;
        double r1790763 = r1790761 * r1790762;
        double r1790764 = r1790760 + r1790763;
        return r1790764;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r1790765 = x_im;
        double r1790766 = y_re;
        double r1790767 = x_re;
        double r1790768 = y_im;
        double r1790769 = r1790767 * r1790768;
        double r1790770 = fma(r1790765, r1790766, r1790769);
        return r1790770;
}

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 2019172 +o rules:numerics
(FPCore (x.re x.im y.re y.im)
  :name "_multiplyComplex, imaginary part"
  (+ (* x.re y.im) (* x.im y.re)))