Average Error: 31.6 → 0.0
Time: 608.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 r52557 = re;
        double r52558 = r52557 * r52557;
        double r52559 = im;
        double r52560 = r52559 * r52559;
        double r52561 = r52558 + r52560;
        double r52562 = sqrt(r52561);
        return r52562;
}
↓
double f(double re, double im) {
        double r52563 = re;
        double r52564 = im;
        double r52565 = hypot(r52563, r52564);
        return r52565;
}

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