Average Error: 0.0 → 0.0
Time: 4.6s
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 r108920 = re;
        double r108921 = r108920 * r108920;
        double r108922 = im;
        double r108923 = r108922 * r108922;
        double r108924 = r108921 - r108923;
        return r108924;
}
↓
double f(double re, double im) {
        double r108925 = re;
        double r108926 = im;
        double r108927 = r108925 + r108926;
        double r108928 = r108925 - r108926;
        double r108929 = r108927 * r108928;
        return r108929;
}

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. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{{re}^{2} - {im}^{2}}\]

  3. Simplified0.0

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

  4. Final simplification0.0

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

Reproduce

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