Average Error: 0.0 → 0.0
Time: 16.8s
Precision: 64
\[re \cdot re - im \cdot im\]
↓
\[re \cdot re - im \cdot im\]
re \cdot re - im \cdot im
↓
re \cdot re - im \cdot im
double f(double re, double im) {
        double r8180 = re;
        double r8181 = r8180 * r8180;
        double r8182 = im;
        double r8183 = r8182 * r8182;
        double r8184 = r8181 - r8183;
        return r8184;
}
↓
double f(double re, double im) {
        double r8185 = re;
        double r8186 = r8185 * r8185;
        double r8187 = im;
        double r8188 = r8187 * r8187;
        double r8189 = r8186 - r8188;
        return r8189;
}

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. Final simplification0.0

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

Reproduce

herbie shell --seed 2019325 
(FPCore (re im)
  :name "math.square on complex, real part"
  :precision binary64
  (- (* re re) (* im im)))