math.abs on complex

Average Error: 0.6 → 0.5

Time: 5.4s

Precision: 64

Math

\[\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)}\]

C

double f(double re, double im) {
        double r155359 = re;
        double r155360 = r155359 * r155359;
        double r155361 = im;
        double r155362 = r155361 * r155361;
        double r155363 = r155360 + r155362;
        double r155364 = sqrt(r155363);
        return r155364;
}

↓

double f(double re, double im) {
        double r155365 = re;
        double r155366 = r155365 * r155365;
        double r155367 = /*Error: no posit support in C */;
        double r155368 = im;
        double r155369 = /*Error: no posit support in C */;
        double r155370 = /*Error: no posit support in C */;
        double r155371 = sqrt(r155370);
        return r155371;
}

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-quire 0.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-add 0.5

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

5. Final simplification 0.5

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

Reproduce

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