Average Error: 29.9 → 0.0
Time: 48.2s
Precision: 64
Internal Precision: 128
\[\frac{x}{x + 1} - \frac{x + 1}{x - 1}\]
↓
\[\begin{array}{l} \mathbf{if}\;x \le -10496.019824687219 \lor \neg \left(x \le 11503.163721655867\right):\\ \;\;\;\;(\left(\frac{-1}{x \cdot x}\right) \cdot \left(\frac{3}{x}\right) + \left(\frac{-1}{x \cdot x} - \frac{3}{x}\right))_*\\ \mathbf{else}:\\ \;\;\;\;(x \cdot \left(\frac{1}{1 + x}\right) + \left(\frac{-\left(1 + x\right)}{x - 1}\right))_*\\ \end{array}\]

Error

Bits error versus x

Derivation

  1. Split input into 2 regimes

  2. if x < -10496.019824687219 or 11503.163721655867 < x

    1. Initial program 59.4

      \[\frac{x}{x + 1} - \frac{x + 1}{x - 1}\]

    2. Taylor expanded around inf 0.3

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

    3. Simplified0.0

      \[\leadsto \color{blue}{(\left(\frac{-1}{x \cdot x}\right) \cdot \left(\frac{3}{x}\right) + \left(\frac{-1}{x \cdot x} - \frac{3}{x}\right))_*}\]

    if -10496.019824687219 < x < 11503.163721655867

    1. Initial program 0.1

      \[\frac{x}{x + 1} - \frac{x + 1}{x - 1}\]
    2. Using strategy rm

    3. Applied div-inv0.1

      \[\leadsto \color{blue}{x \cdot \frac{1}{x + 1}} - \frac{x + 1}{x - 1}\]

    4. Applied fma-neg0.1

      \[\leadsto \color{blue}{(x \cdot \left(\frac{1}{x + 1}\right) + \left(-\frac{x + 1}{x - 1}\right))_*}\]
  3. Recombined 2 regimes into one program.

  4. Final simplification0.0

    \[\leadsto \begin{array}{l} \mathbf{if}\;x \le -10496.019824687219 \lor \neg \left(x \le 11503.163721655867\right):\\ \;\;\;\;(\left(\frac{-1}{x \cdot x}\right) \cdot \left(\frac{3}{x}\right) + \left(\frac{-1}{x \cdot x} - \frac{3}{x}\right))_*\\ \mathbf{else}:\\ \;\;\;\;(x \cdot \left(\frac{1}{1 + x}\right) + \left(\frac{-\left(1 + x\right)}{x - 1}\right))_*\\ \end{array}\]

Reproduce

herbie shell --seed 2019026 +o rules:numerics
(FPCore (x)
  :name "Asymptote C"
  (- (/ x (+ x 1)) (/ (+ x 1) (- x 1))))