Average Error: 0.0 → 0.0
Time: 6.4s
Precision: 64
\[re \cdot re - im \cdot im\]
↓
\[\left(re - im\right) \cdot \left(re + im\right)\]
re \cdot re - im \cdot im
↓
\left(re - im\right) \cdot \left(re + im\right)
double f(double re, double im) {
        double r178 = re;
        double r179 = r178 * r178;
        double r180 = im;
        double r181 = r180 * r180;
        double r182 = r179 - r181;
        return r182;
}
↓
double f(double re, double im) {
        double r183 = re;
        double r184 = im;
        double r185 = r183 - r184;
        double r186 = r183 + r184;
        double r187 = r185 * r186;
        return r187;
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[re \cdot re - im \cdot im\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(re - im\right) \cdot \left(re + im\right)}\]

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2020043 +o rules:numerics
(FPCore (re im)
  :name "math.square on complex, real part"
  :precision binary64
  (- (* re re) (* im im)))