Average Error: 0.0 → 0.0
Time: 4.9s
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 r8150 = re;
        double r8151 = r8150 * r8150;
        double r8152 = im;
        double r8153 = r8152 * r8152;
        double r8154 = r8151 - r8153;
        return r8154;
}
↓
double f(double re, double im) {
        double r8155 = re;
        double r8156 = r8155 * r8155;
        double r8157 = im;
        double r8158 = r8157 * r8157;
        double r8159 = r8156 - r8158;
        return r8159;
}

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 2019212 
(FPCore (re im)
  :name "math.square on complex, real part"
  :precision binary64
  (- (* re re) (* im im)))