Average Error: 0.1 → 0.1
Time: 8.5s
Precision: 64
\[1.0 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
↓
\[1.0 - \left(0.253 + 0.12 \cdot x\right) \cdot x\]
1.0 - x \cdot \left(0.253 + x \cdot 0.12\right)
↓
1.0 - \left(0.253 + 0.12 \cdot x\right) \cdot x
double f(double x) {
        double r1827813 = 1.0;
        double r1827814 = x;
        double r1827815 = 0.253;
        double r1827816 = 0.12;
        double r1827817 = r1827814 * r1827816;
        double r1827818 = r1827815 + r1827817;
        double r1827819 = r1827814 * r1827818;
        double r1827820 = r1827813 - r1827819;
        return r1827820;
}
↓
double f(double x) {
        double r1827821 = 1.0;
        double r1827822 = 0.253;
        double r1827823 = 0.12;
        double r1827824 = x;
        double r1827825 = r1827823 * r1827824;
        double r1827826 = r1827822 + r1827825;
        double r1827827 = r1827826 * r1827824;
        double r1827828 = r1827821 - r1827827;
        return r1827828;
}

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.0 - x \cdot \left(0.253 + x \cdot 0.12\right)\]

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2019156 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  (- 1.0 (* x (+ 0.253 (* x 0.12)))))