Average Error: 31.7 → 0.0
Time: 405.0ms
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 r43740 = re;
        double r43741 = r43740 * r43740;
        double r43742 = im;
        double r43743 = r43742 * r43742;
        double r43744 = r43741 + r43743;
        double r43745 = sqrt(r43744);
        return r43745;
}
↓
double f(double re, double im) {
        double r43746 = re;
        double r43747 = im;
        double r43748 = hypot(r43746, r43747);
        return r43748;
}

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.7

    \[\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 2020027 +o rules:numerics
(FPCore (re im)
  :name "math.abs on complex"
  :precision binary64
  (sqrt (+ (* re re) (* im im))))