Average Error: 0.0 → 0.0
Time: 13.0s
Precision: 64
Internal Precision: 128
\[\frac{1 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}\]
↓
\[\frac{1 + \left(2 - \frac{2}{1 + t}\right) \cdot \left(2 - \frac{2}{1 + t}\right)}{\frac{4 - \frac{2}{1 + t} \cdot \frac{2}{1 + t}}{2 + \frac{2}{1 + t}} \cdot \left(2 - \frac{2}{1 + t}\right) + 2}\]

Error

Bits error versus t

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

    \[\leadsto \color{blue}{\frac{1 + \left(2 - \frac{2}{1 + t}\right) \cdot \left(2 - \frac{2}{1 + t}\right)}{2 + \left(2 - \frac{2}{1 + t}\right) \cdot \left(2 - \frac{2}{1 + t}\right)}}\]
  3. Using strategy rm

  4. Applied flip--0.0

    \[\leadsto \frac{1 + \left(2 - \frac{2}{1 + t}\right) \cdot \left(2 - \frac{2}{1 + t}\right)}{2 + \color{blue}{\frac{2 \cdot 2 - \frac{2}{1 + t} \cdot \frac{2}{1 + t}}{2 + \frac{2}{1 + t}}} \cdot \left(2 - \frac{2}{1 + t}\right)}\]

  5. Final simplification0.0

    \[\leadsto \frac{1 + \left(2 - \frac{2}{1 + t}\right) \cdot \left(2 - \frac{2}{1 + t}\right)}{\frac{4 - \frac{2}{1 + t} \cdot \frac{2}{1 + t}}{2 + \frac{2}{1 + t}} \cdot \left(2 - \frac{2}{1 + t}\right) + 2}\]

Reproduce

herbie shell --seed 2019093 
(FPCore (t)
  :name "Kahan p13 Example 2"
  (/ (+ 1 (* (- 2 (/ (/ 2 t) (+ 1 (/ 1 t)))) (- 2 (/ (/ 2 t) (+ 1 (/ 1 t)))))) (+ 2 (* (- 2 (/ (/ 2 t) (+ 1 (/ 1 t)))) (- 2 (/ (/ 2 t) (+ 1 (/ 1 t))))))))