Average Error: 0.0 → 0.0
Time: 1.7s
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 r30638 = x_re;
        double r30639 = y_im;
        double r30640 = r30638 * r30639;
        double r30641 = x_im;
        double r30642 = y_re;
        double r30643 = r30641 * r30642;
        double r30644 = r30640 + r30643;
        return r30644;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r30645 = x_re;
        double r30646 = y_im;
        double r30647 = r30645 * r30646;
        double r30648 = x_im;
        double r30649 = y_re;
        double r30650 = r30648 * r30649;
        double r30651 = r30647 + r30650;
        return r30651;
}

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