Average Error: 0.0 → 0.0

Time: 1.8s

Precision: 64

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

↓

\[im \cdot \left(re + re\right)\]

re \cdot im + im \cdot re

↓

im \cdot \left(re + re\right)

double f(double re, double im) {
        double r8317 = re;
        double r8318 = im;
        double r8319 = r8317 * r8318;
        double r8320 = r8318 * r8317;
        double r8321 = r8319 + r8320;
        return r8321;
}

↓

double f(double re, double im) {
        double r8322 = im;
        double r8323 = re;
        double r8324 = r8323 + r8323;
        double r8325 = r8322 * r8324;
        return r8325;
}

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}{im \cdot \left(re + re\right)}\]
Final simplification0.0
\[\leadsto im \cdot \left(re + re\right)\]

Reproduce

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