Average Error: 0.1 → 0.1
Time: 4.1s
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 r96146 = 1.0;
        double r96147 = x;
        double r96148 = 0.253;
        double r96149 = 0.12;
        double r96150 = r96147 * r96149;
        double r96151 = r96148 + r96150;
        double r96152 = r96147 * r96151;
        double r96153 = r96146 - r96152;
        return r96153;
}
↓
double f(double x) {
        double r96154 = 1.0;
        double r96155 = x;
        double r96156 = 0.253;
        double r96157 = 0.12;
        double r96158 = r96155 * r96157;
        double r96159 = r96156 + r96158;
        double r96160 = r96155 * r96159;
        double r96161 = r96154 - r96160;
        return r96161;
}

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