Average Error: 0.1 → 0.1
Time: 4.4s
Precision: 64
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
↓
\[\mathsf{fma}\left(-x, \mathsf{fma}\left(0.12, x, 0.253\right), 1\right)\]
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
↓
\mathsf{fma}\left(-x, \mathsf{fma}\left(0.12, x, 0.253\right), 1\right)
double code(double x) {
	return (1.0 - (x * (0.253 + (x * 0.12))));
}
↓
double code(double x) {
	return fma(-x, fma(0.12, x, 0.253), 1.0);
}

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. Simplified0.1

    \[\leadsto \color{blue}{\mathsf{fma}\left(-x, \mathsf{fma}\left(0.12, x, 0.253\right), 1\right)}\]

  3. Final simplification0.1

    \[\leadsto \mathsf{fma}\left(-x, \mathsf{fma}\left(0.12, x, 0.253\right), 1\right)\]

Reproduce

herbie shell --seed 2020102 +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)))))