Average Error: 0.0 → 0.0
Time: 3.1s
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 r49800 = x_re;
        double r49801 = y_im;
        double r49802 = r49800 * r49801;
        double r49803 = x_im;
        double r49804 = y_re;
        double r49805 = r49803 * r49804;
        double r49806 = r49802 + r49805;
        return r49806;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r49807 = x_re;
        double r49808 = y_im;
        double r49809 = r49807 * r49808;
        double r49810 = x_im;
        double r49811 = y_re;
        double r49812 = r49810 * r49811;
        double r49813 = r49809 + r49812;
        return r49813;
}

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 2020021 
(FPCore (x.re x.im y.re y.im)
  :name "_multiplyComplex, imaginary part"
  :precision binary64
  (+ (* x.re y.im) (* x.im y.re)))