Average Error: 0.0 → 0.1
Time: 1.5s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) (x - ((double) (((double) (2.30753 + ((double) (x * 0.27061)))) / ((double) (1.0 + ((double) (((double) (0.99229 + ((double) (x * 0.04481)))) * x))))))));
}

↓
double code(double x) {
	return ((double) (x - ((double) (((double) (1.0 / ((double) sqrt(((double) (1.0 + ((double) (x * ((double) (0.99229 + ((double) (x * 0.04481)))))))))))) * ((double) (((double) (2.30753 + ((double) (x * 0.27061)))) / ((double) sqrt(((double) (1.0 + ((double) (x * ((double) (0.99229 + ((double) (x * 0.04481))))))))))))))));
}

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
    \[\]
  2. Using strategy rm
  3. Applied add-sqr-sqrt0.1
    \[\leadsto \]
  4. Applied *-un-lft-identity0.1
    \[\leadsto \]
  5. Applied times-frac0.1
    \[\leadsto \]
  6. Simplified0.1
    \[\leadsto \]
  7. Simplified0.1
    \[\leadsto \]
  8. Final simplification0.1
    \[\leadsto \]
Reproduce
herbie shell --seed 2020180 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, D"
  :precision binary64
  (- x (/ (+ 2.30753 (* x 0.27061)) (+ 1.0 (* (+ 0.99229 (* x 0.04481)) x)))))