Average Error: 0.0 → 0.0
Time: 48.9s
Precision: 64
\[x.re \cdot y.re - x.im \cdot y.im\]
↓
\[x.re \cdot y.re - x.im \cdot y.im\]
x.re \cdot y.re - x.im \cdot y.im
↓
x.re \cdot y.re - x.im \cdot y.im
double f(double x_re, double x_im, double y_re, double y_im) {
        double r6290064 = x_re;
        double r6290065 = y_re;
        double r6290066 = r6290064 * r6290065;
        double r6290067 = x_im;
        double r6290068 = y_im;
        double r6290069 = r6290067 * r6290068;
        double r6290070 = r6290066 - r6290069;
        return r6290070;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r6290071 = x_re;
        double r6290072 = y_re;
        double r6290073 = r6290071 * r6290072;
        double r6290074 = x_im;
        double r6290075 = y_im;
        double r6290076 = r6290074 * r6290075;
        double r6290077 = r6290073 - r6290076;
        return r6290077;
}

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.re - x.im \cdot y.im\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019125 
(FPCore (x.re x.im y.re y.im)
  :name "_multiplyComplex, real part"
  (- (* x.re y.re) (* x.im y.im)))