Average Error: 0.0 → 0.0
Time: 3.0s
Precision: 64
\[x.re \cdot y.im + x.im \cdot y.re\]
↓
\[x.re \cdot y.im + x.im \cdot y.re\]
x.re \cdot y.im + x.im \cdot y.re
↓
x.re \cdot y.im + x.im \cdot y.re
double f(double x_re, double x_im, double y_re, double y_im) {
        double r99843 = x_re;
        double r99844 = y_im;
        double r99845 = r99843 * r99844;
        double r99846 = x_im;
        double r99847 = y_re;
        double r99848 = r99846 * r99847;
        double r99849 = r99845 + r99848;
        return r99849;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r99850 = x_re;
        double r99851 = y_im;
        double r99852 = r99850 * r99851;
        double r99853 = x_im;
        double r99854 = y_re;
        double r99855 = r99853 * r99854;
        double r99856 = r99852 + r99855;
        return r99856;
}

Error

Bits error versus x.re

Bits error versus x.im

Bits error versus y.re

Bits error versus y.im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x.re \cdot y.im + x.im \cdot y.re\]

  2. Final simplification0.0

    \[\leadsto x.re \cdot y.im + x.im \cdot y.re\]

Reproduce

herbie shell --seed 2020060 
(FPCore (x.re x.im y.re y.im)
  :name "_multiplyComplex, imaginary part"
  :precision binary64
  (+ (* x.re y.im) (* x.im y.re)))