Average Error: 0.0 → 0.0
Time: 1.5m
Precision: 64
\[\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{(\left(2 - \frac{2}{1 + t}\right) \cdot \left(2 - \frac{2}{1 + t}\right) + 1)_*}{(\left(2 - \frac{2}{1 + t}\right) \cdot \left(2 - \frac{2}{1 + t}\right) + 2)_*}\]
double f(double t) {
        double r3896536 = 1.0;
        double r3896537 = 2.0;
        double r3896538 = t;
        double r3896539 = r3896537 / r3896538;
        double r3896540 = r3896536 / r3896538;
        double r3896541 = r3896536 + r3896540;
        double r3896542 = r3896539 / r3896541;
        double r3896543 = r3896537 - r3896542;
        double r3896544 = r3896543 * r3896543;
        double r3896545 = r3896536 + r3896544;
        double r3896546 = r3896537 + r3896544;
        double r3896547 = r3896545 / r3896546;
        return r3896547;
}
↓
double f(double t) {
        double r3896548 = 2.0;
        double r3896549 = 1.0;
        double r3896550 = t;
        double r3896551 = r3896549 + r3896550;
        double r3896552 = r3896548 / r3896551;
        double r3896553 = r3896548 - r3896552;
        double r3896554 = fma(r3896553, r3896553, r3896549);
        double r3896555 = fma(r3896553, r3896553, r3896548);
        double r3896556 = r3896554 / r3896555;
        return r3896556;
}


\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{(\left(2 - \frac{2}{1 + t}\right) \cdot \left(2 - \frac{2}{1 + t}\right) + 1)_*}{(\left(2 - \frac{2}{1 + t}\right) \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{(\left(2 - \frac{2}{1 + t}\right) \cdot \left(2 - \frac{2}{1 + t}\right) + 1)_*}{(\left(2 - \frac{2}{1 + t}\right) \cdot \left(2 - \frac{2}{1 + t}\right) + 2)_*}}\]

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019102 +o rules:numerics
(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))))))))