Average Error: 0.6 → 0.5
Time: 5.1s
Precision: 64
\[\sqrt{\left(\frac{\left(re \cdot re\right)}{\left(im \cdot im\right)}\right)}\]
↓
\[\sqrt{\left(\mathsf{qma}\left(\left(\left(re \cdot re\right)\right), im, im\right)\right)}\]
\sqrt{\left(\frac{\left(re \cdot re\right)}{\left(im \cdot im\right)}\right)}
↓
\sqrt{\left(\mathsf{qma}\left(\left(\left(re \cdot re\right)\right), im, im\right)\right)}
double f(double re, double im) {
        double r352022 = re;
        double r352023 = r352022 * r352022;
        double r352024 = im;
        double r352025 = r352024 * r352024;
        double r352026 = r352023 + r352025;
        double r352027 = sqrt(r352026);
        return r352027;
}
↓
double f(double re, double im) {
        double r352028 = re;
        double r352029 = r352028 * r352028;
        double r352030 = /*Error: no posit support in C */;
        double r352031 = im;
        double r352032 = /*Error: no posit support in C */;
        double r352033 = /*Error: no posit support in C */;
        double r352034 = sqrt(r352033);
        return r352034;
}

Error

Bits error versus re

Bits error versus im

Derivation

  1. Initial program 0.6

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

  3. Applied introduce-quire0.6

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

  4. Applied insert-quire-fdp-add0.5

    \[\leadsto \sqrt{\color{blue}{\left(\left(\mathsf{qma}\left(\left(\left(re \cdot re\right)\right), im, im\right)\right)\right)}}\]

  5. Final simplification0.5

    \[\leadsto \sqrt{\left(\mathsf{qma}\left(\left(\left(re \cdot re\right)\right), im, im\right)\right)}\]

Reproduce

herbie shell --seed 2019154 
(FPCore (re im)
  :name "math.abs on complex"
  (sqrt.p16 (+.p16 (*.p16 re re) (*.p16 im im))))