Average Error: 0.0 → 0.0
Time: 3.8s
Precision: 64
\[\frac{2.30753 + x \cdot 0.27061000000000002}{1 + x \cdot \left(0.992290000000000005 + x \cdot 0.044810000000000003\right)} - x\]
↓
\[\mathsf{fma}\left(2.30753 + x \cdot 0.27061000000000002, \frac{1}{1 + x \cdot \left(0.992290000000000005 + x \cdot 0.044810000000000003\right)}, -x\right)\]
\frac{2.30753 + x \cdot 0.27061000000000002}{1 + x \cdot \left(0.992290000000000005 + x \cdot 0.044810000000000003\right)} - x
↓
\mathsf{fma}\left(2.30753 + x \cdot 0.27061000000000002, \frac{1}{1 + x \cdot \left(0.992290000000000005 + x \cdot 0.044810000000000003\right)}, -x\right)
double code(double x) {
	return (((2.30753 + (x * 0.27061)) / (1.0 + (x * (0.99229 + (x * 0.04481))))) - x);
}
↓
double code(double x) {
	return fma((2.30753 + (x * 0.27061)), (1.0 / (1.0 + (x * (0.99229 + (x * 0.04481))))), -x);
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{2.30753 + x \cdot 0.27061000000000002}{1 + x \cdot \left(0.992290000000000005 + x \cdot 0.044810000000000003\right)} - x\]
  2. Using strategy rm

  3. Applied div-inv0.0

    \[\leadsto \color{blue}{\left(2.30753 + x \cdot 0.27061000000000002\right) \cdot \frac{1}{1 + x \cdot \left(0.992290000000000005 + x \cdot 0.044810000000000003\right)}} - x\]

  4. Applied fma-neg0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(2.30753 + x \cdot 0.27061000000000002, \frac{1}{1 + x \cdot \left(0.992290000000000005 + x \cdot 0.044810000000000003\right)}, -x\right)}\]

  5. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(2.30753 + x \cdot 0.27061000000000002, \frac{1}{1 + x \cdot \left(0.992290000000000005 + x \cdot 0.044810000000000003\right)}, -x\right)\]

Reproduce

herbie shell --seed 2020057 +o rules:numerics
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, C"
  :precision binary64
  (- (/ (+ 2.30753 (* x 0.27061)) (+ 1 (* x (+ 0.99229 (* x 0.04481))))) x))