Average Error: 0.0 → 0.0
Time: 10.5s
Precision: 64
\[\frac{x}{x + y}\]
\[\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{x}{x + y}\right)\right)\]
\frac{x}{x + y}
\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{x}{x + y}\right)\right)
double f(double x, double y) {
        double r164297 = x;
        double r164298 = y;
        double r164299 = r164297 + r164298;
        double r164300 = r164297 / r164299;
        return r164300;
}

double f(double x, double y) {
        double r164301 = x;
        double r164302 = y;
        double r164303 = r164301 + r164302;
        double r164304 = r164301 / r164303;
        double r164305 = log1p(r164304);
        double r164306 = expm1(r164305);
        return r164306;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{x}{x + y}\]
  2. Using strategy rm
  3. Applied expm1-log1p-u0.0

    \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{x}{x + y}\right)\right)}\]
  4. Final simplification0.0

    \[\leadsto \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{x}{x + y}\right)\right)\]

Reproduce

herbie shell --seed 2019325 +o rules:numerics
(FPCore (x y)
  :name "AI.Clustering.Hierarchical.Internal:average from clustering-0.2.1, A"
  :precision binary64
  (/ x (+ x y)))