Asymptote C

Average Error: 29.4 → 0.1

Time: 3.3s

Precision: binary64

Math

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

↓

\[\begin{array}{l} \mathbf{if}\;x \le -13297.414417868251 \lor \neg \left(x \le 13297.252132290163\right):\\ \;\;\;\;\left(\frac{-1}{{x}^{2}} - \frac{3}{x}\right) - \frac{3}{{x}^{3}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + 1} - \left(x + 1\right) \cdot \frac{1}{x - 1}\\ \end{array}\]

Error

Bits error versus x

Derivation

1. Split input into 2 regimes

2. if x < -13297.414417868251 or 13297.252132290163 < x

   1. Initial program 59.2

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

   2. Taylor expanded around inf 0.3

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

   3. Simplified 0.0

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

   if -13297.414417868251 < x < 13297.252132290163

   1. Initial program 0.1

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

   3. Applied div-inv 0.1

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

4. Final simplification 0.1

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \le -13297.414417868251 \lor \neg \left(x \le 13297.252132290163\right):\\ \;\;\;\;\left(\frac{-1}{{x}^{2}} - \frac{3}{x}\right) - \frac{3}{{x}^{3}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + 1} - \left(x + 1\right) \cdot \frac{1}{x - 1}\\ \end{array}\]

Reproduce

herbie shell --seed 2020163 
(FPCore (x)
  :name "Asymptote C"
  :precision binary64
  (- (/ x (+ x 1.0)) (/ (+ x 1.0) (- x 1.0))))