Average Error: 31.3 → 0.0
Time: 9.3s
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 r47350 = re;
        double r47351 = r47350 * r47350;
        double r47352 = im;
        double r47353 = r47352 * r47352;
        double r47354 = r47351 + r47353;
        double r47355 = sqrt(r47354);
        return r47355;
}
↓
double f(double re, double im) {
        double r47356 = re;
        double r47357 = im;
        double r47358 = hypot(r47356, r47357);
        return r47358;
}

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

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