Average Error: 0.0 → 0.0

Time: 1.5s

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 r8294 = re;
        double r8295 = im;
        double r8296 = r8294 * r8295;
        double r8297 = r8295 * r8294;
        double r8298 = r8296 + r8297;
        return r8298;
}

↓

double f(double re, double im) {
        double r8299 = im;
        double r8300 = re;
        double r8301 = r8300 + r8300;
        double r8302 = r8299 * r8301;
        return r8302;
}

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

Reproduce

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