Average Error: 0.1 → 0.1
Time: 4.6s
Precision: 64
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
↓
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
↓
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
double f(double x) {
        double r75244 = 1.0;
        double r75245 = x;
        double r75246 = 0.253;
        double r75247 = 0.12;
        double r75248 = r75245 * r75247;
        double r75249 = r75246 + r75248;
        double r75250 = r75245 * r75249;
        double r75251 = r75244 - r75250;
        return r75251;
}
↓
double f(double x) {
        double r75252 = 1.0;
        double r75253 = x;
        double r75254 = 0.253;
        double r75255 = 0.12;
        double r75256 = r75253 * r75255;
        double r75257 = r75254 + r75256;
        double r75258 = r75253 * r75257;
        double r75259 = r75252 - r75258;
        return r75259;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]

  2. Final simplification0.1

    \[\leadsto 1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]

Reproduce

herbie shell --seed 2020089 +o rules:numerics
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (- 1 (* x (+ 0.253 (* x 0.12)))))