Average Error: 1.1 → 1.0
Time: 24.4s
Precision: 64
\[\frac{\left(\frac{\left(x.re \cdot y.re\right)}{\left(x.im \cdot y.im\right)}\right)}{\left(\frac{\left(y.re \cdot y.re\right)}{\left(y.im \cdot y.im\right)}\right)}\]
↓
\[\frac{\left(\mathsf{qma}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)}{\left(\mathsf{qma}\left(\left(\left(y.re \cdot y.re\right)\right), y.im, y.im\right)\right)}\]
\frac{\left(\frac{\left(x.re \cdot y.re\right)}{\left(x.im \cdot y.im\right)}\right)}{\left(\frac{\left(y.re \cdot y.re\right)}{\left(y.im \cdot y.im\right)}\right)}
↓
\frac{\left(\mathsf{qma}\left(\left(\left(x.re \cdot y.re\right)\right), x.im, y.im\right)\right)}{\left(\mathsf{qma}\left(\left(\left(y.re \cdot y.re\right)\right), y.im, y.im\right)\right)}
double f(double x_re, double x_im, double y_re, double y_im) {
        double r690614 = x_re;
        double r690615 = y_re;
        double r690616 = r690614 * r690615;
        double r690617 = x_im;
        double r690618 = y_im;
        double r690619 = r690617 * r690618;
        double r690620 = r690616 + r690619;
        double r690621 = r690615 * r690615;
        double r690622 = r690618 * r690618;
        double r690623 = r690621 + r690622;
        double r690624 = r690620 / r690623;
        return r690624;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r690625 = x_re;
        double r690626 = y_re;
        double r690627 = r690625 * r690626;
        double r690628 = /*Error: no posit support in C */;
        double r690629 = x_im;
        double r690630 = y_im;
        double r690631 = /*Error: no posit support in C */;
        double r690632 = /*Error: no posit support in C */;
        double r690633 = r690626 * r690626;
        double r690634 = /*Error: no posit support in C */;
        double r690635 = /*Error: no posit support in C */;
        double r690636 = /*Error: no posit support in C */;
        double r690637 = r690632 / r690636;
        return r690637;
}

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 1.1

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

  3. Applied introduce-quire1.1

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

  4. Applied insert-quire-fdp-add1.1

    \[\leadsto \frac{\left(\frac{\left(x.re \cdot y.re\right)}{\left(x.im \cdot y.im\right)}\right)}{\color{blue}{\left(\left(\mathsf{qma}\left(\left(\left(y.re \cdot y.re\right)\right), y.im, y.im\right)\right)\right)}}\]
  5. Using strategy rm

  6. Applied introduce-quire1.1

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

  7. Applied insert-quire-fdp-add1.0

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

  8. Final simplification1.0

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

Reproduce

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