Average Error: 0.0 → 0.0

Time: 1.2s

Precision: 64

\[re \cdot im + im \cdot re\]

↓

\[re \cdot im + re \cdot im\]

re \cdot im + im \cdot re

↓

re \cdot im + re \cdot im

double f(double re, double im) {
        double r8409 = re;
        double r8410 = im;
        double r8411 = r8409 * r8410;
        double r8412 = r8410 * r8409;
        double r8413 = r8411 + r8412;
        return r8413;
}

↓

double f(double re, double im) {
        double r8414 = re;
        double r8415 = im;
        double r8416 = r8414 * r8415;
        double r8417 = r8416 + r8416;
        return r8417;
}

Error

The X axis uses an exponential scale — Bits error versus `re`

Try it out

In
Out

Enter valid numbers for all inputs

Derivation

Initial program 0.0
\[re \cdot im + im \cdot re\]
Simplified0.0
\[\leadsto \color{blue}{re \cdot im + re \cdot im}\]
Final simplification0.0
\[\leadsto re \cdot im + re \cdot im\]

Reproduce

herbie shell --seed 2019151 
(FPCore (re im)
  :name "math.square on complex, imaginary part"
  (+ (* re im) (* im re)))