Average Error: 0.1 → 0.1
Time: 6.8s
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 r80077 = 1.0;
        double r80078 = x;
        double r80079 = 0.253;
        double r80080 = 0.12;
        double r80081 = r80078 * r80080;
        double r80082 = r80079 + r80081;
        double r80083 = r80078 * r80082;
        double r80084 = r80077 - r80083;
        return r80084;
}
↓
double f(double x) {
        double r80085 = 1.0;
        double r80086 = x;
        double r80087 = 0.253;
        double r80088 = 0.12;
        double r80089 = r80086 * r80088;
        double r80090 = r80087 + r80089;
        double r80091 = r80086 * r80090;
        double r80092 = r80085 - r80091;
        return r80092;
}

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 2020046 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (- 1 (* x (+ 0.253 (* x 0.12)))))