Average Error: 0.1 → 0.1
Time: 3.5s
Precision: 64
\[re \cdot im + im \cdot re\]
↓
\[re \cdot \left(im + im\right)\]
double f(double re, double im) {
        double r8829 = re;
        double r8830 = im;
        double r8831 = r8829 * r8830;
        double r8832 = r8830 * r8829;
        double r8833 = r8831 + r8832;
        return r8833;
}
↓
double f(double re, double im) {
        double r8834 = re;
        double r8835 = im;
        double r8836 = r8835 + r8835;
        double r8837 = r8834 * r8836;
        return r8837;
}


re \cdot im + im \cdot re
↓
re \cdot \left(im + im\right)

Error

Bits error versus re

Bits error versus im

Derivation

  1. Initial program 0.1

    \[\frac{\left(re \cdot im\right)}{\left(im \cdot re\right)}\]

  2. Simplified0.1

    \[\leadsto \color{blue}{\frac{\left(im \cdot re\right)}{\left(im \cdot re\right)}}\]
  3. Using strategy rm

  4. Applied distribute-rgt-out0.1

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

  5. Final simplification0.1

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

Reproduce

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