Average Error: 46.0 → 0.4
Time: 18.2s
Precision: binary64
\[i > 0\]
\[\frac{\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right)}}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right) - 1}\]
↓
\[\frac{0.25}{4 + \frac{\frac{-1}{i}}{i}}\]
\frac{\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right)}}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right) - 1}
↓
\frac{0.25}{4 + \frac{\frac{-1}{i}}{i}}
(FPCore (i)
 :precision binary64
 (/
  (/ (* (* i i) (* i i)) (* (* 2.0 i) (* 2.0 i)))
  (- (* (* 2.0 i) (* 2.0 i)) 1.0)))
↓
(FPCore (i) :precision binary64 (/ 0.25 (+ 4.0 (/ (/ -1.0 i) i))))
double code(double i) {
	return (((i * i) * (i * i)) / ((2.0 * i) * (2.0 * i))) / (((2.0 * i) * (2.0 * i)) - 1.0);
}
↓
double code(double i) {
	return 0.25 / (4.0 + ((-1.0 / i) / i));
}

Error

Bits error versus i

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 46.0

    \[\frac{\frac{\left(i \cdot i\right) \cdot \left(i \cdot i\right)}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right)}}{\left(2 \cdot i\right) \cdot \left(2 \cdot i\right) - 1}\]

  2. Simplified0.3

    \[\leadsto \color{blue}{\frac{0.25}{4 + \frac{-1}{i \cdot i}}}\]
  3. Using strategy rm

  4. Applied associate-/r*_binary640.4

    \[\leadsto \frac{0.25}{4 + \color{blue}{\frac{\frac{-1}{i}}{i}}}\]

  5. Final simplification0.4

    \[\leadsto \frac{0.25}{4 + \frac{\frac{-1}{i}}{i}}\]

Reproduce

herbie shell --seed 2020288 
(FPCore (i)
  :name "Octave 3.8, jcobi/4, as called"
  :precision binary64
  :pre (and (> i 0.0))
  (/ (/ (* (* i i) (* i i)) (* (* 2.0 i) (* 2.0 i))) (- (* (* 2.0 i) (* 2.0 i)) 1.0)))