Average Error: 0.2 → 0.3
Time: 2.4s
Precision: binary64
\[\]
\[\]
double code(double x) {
	return ((double) (x / ((double) (1.0 + ((double) sqrt(((double) (x + 1.0))))))));
}
double code(double x) {
	return ((double) (x / ((double) (1.0 + ((double) (((double) fabs(((double) cbrt(((double) (x + 1.0)))))) * ((double) sqrt(((double) cbrt(((double) (x + 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.2

    \[\]
  2. Using strategy rm
  3. Applied add-cube-cbrt0.3

    \[\leadsto \]
  4. Applied sqrt-prod0.3

    \[\leadsto \]
  5. Simplified0.3

    \[\leadsto \]
  6. Final simplification0.3

    \[\leadsto \]

Reproduce

herbie shell --seed 2020180 
(FPCore (x)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, B"
  :precision binary64
  (/ x (+ 1.0 (sqrt (+ x 1.0)))))