Average Error: 0.3 → 0.2
Time: 40.4s
Precision: 64
\[\left(x.re \cdot y.re\right) - \left(x.im \cdot y.im\right)\]
↓
\[\left(\mathsf{qms}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)\]
\left(x.re \cdot y.re\right) - \left(x.im \cdot y.im\right)
↓
\left(\mathsf{qms}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)
double f(double x_re, double x_im, double y_re, double y_im) {
        double r1681346 = x_re;
        double r1681347 = y_re;
        double r1681348 = r1681346 * r1681347;
        double r1681349 = x_im;
        double r1681350 = y_im;
        double r1681351 = r1681349 * r1681350;
        double r1681352 = r1681348 - r1681351;
        return r1681352;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r1681353 = x_re;
        double r1681354 = y_re;
        double r1681355 = r1681353 * r1681354;
        double r1681356 = /*Error: no posit support in C */;
        double r1681357 = x_im;
        double r1681358 = y_im;
        double r1681359 = /*Error: no posit support in C */;
        double r1681360 = /*Error: no posit support in C */;
        return r1681360;
}

Error

Bits error versus x.re

Bits error versus x.im

Bits error versus y.re

Bits error versus y.im

Derivation

  1. Initial program 0.3

    \[\left(x.re \cdot y.re\right) - \left(x.im \cdot y.im\right)\]
  2. Using strategy rm

  3. Applied introduce-quire0.3

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

  4. Applied insert-quire-fdp-sub0.2

    \[\leadsto \color{blue}{\left(\mathsf{qms}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)}\]

  5. Final simplification0.2

    \[\leadsto \left(\mathsf{qms}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)\]

Reproduce

herbie shell --seed 2019163 +o rules:numerics
(FPCore (x.re x.im y.re y.im)
  :name "_multiplyComplex, real part"
  (-.p16 (*.p16 x.re y.re) (*.p16 x.im y.im)))