Average Error: 1.1 → 1.0
Time: 17.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 r728896 = x_re;
        double r728897 = y_re;
        double r728898 = r728896 * r728897;
        double r728899 = x_im;
        double r728900 = y_im;
        double r728901 = r728899 * r728900;
        double r728902 = r728898 + r728901;
        double r728903 = r728897 * r728897;
        double r728904 = r728900 * r728900;
        double r728905 = r728903 + r728904;
        double r728906 = r728902 / r728905;
        return r728906;
}
↓
double f(double x_re, double x_im, double y_re, double y_im) {
        double r728907 = x_re;
        double r728908 = y_re;
        double r728909 = r728907 * r728908;
        double r728910 = /*Error: no posit support in C */;
        double r728911 = x_im;
        double r728912 = y_im;
        double r728913 = /*Error: no posit support in C */;
        double r728914 = /*Error: no posit support in C */;
        double r728915 = r728908 * r728908;
        double r728916 = /*Error: no posit support in C */;
        double r728917 = /*Error: no posit support in C */;
        double r728918 = /*Error: no posit support in C */;
        double r728919 = r728914 / r728918;
        return r728919;
}

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 2019156 +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))))