Average Error: 31.6 → 0.0
Time: 3.6s
Precision: 64
\[\sqrt{re \cdot re + im \cdot im}\]
↓
\[\mathsf{hypot}\left(re, im\right)\]
\sqrt{re \cdot re + im \cdot im}
↓
\mathsf{hypot}\left(re, im\right)
double f(double re, double im) {
        double r37184 = re;
        double r37185 = r37184 * r37184;
        double r37186 = im;
        double r37187 = r37186 * r37186;
        double r37188 = r37185 + r37187;
        double r37189 = sqrt(r37188);
        return r37189;
}
↓
double f(double re, double im) {
        double r37190 = re;
        double r37191 = im;
        double r37192 = hypot(r37190, r37191);
        return r37192;
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 31.6

    \[\sqrt{re \cdot re + im \cdot im}\]

  2. Simplified0.0

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

  3. Final simplification0.0

    \[\leadsto \mathsf{hypot}\left(re, im\right)\]

Reproduce

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