Asymptote A

Percentage Accurate: 77.3% → 99.3%

Time: 4.0s

Alternatives: 3

Speedup: 1.8×

Specification

Math

\[\begin{array}{l} \\ \frac{1}{x + 1} - \frac{1}{x - 1} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (/ 1.0 (+ x 1.0)) (/ 1.0 (- x 1.0))))

C

double code(double x) {
	return (1.0 / (x + 1.0)) - (1.0 / (x - 1.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (1.0d0 / (x + 1.0d0)) - (1.0d0 / (x - 1.0d0))
end function

Java

public static double code(double x) {
	return (1.0 / (x + 1.0)) - (1.0 / (x - 1.0));
}

Python

def code(x):
	return (1.0 / (x + 1.0)) - (1.0 / (x - 1.0))

Julia

function code(x)
	return Float64(Float64(1.0 / Float64(x + 1.0)) - Float64(1.0 / Float64(x - 1.0)))
end

MATLAB

function tmp = code(x)
	tmp = (1.0 / (x + 1.0)) - (1.0 / (x - 1.0));
end

Wolfram

code[x_] := N[(N[(1.0 / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] - N[(1.0 / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 77.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{x + 1} - \frac{1}{x - 1} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (/ 1.0 (+ x 1.0)) (/ 1.0 (- x 1.0))))

C

double code(double x) {
	return (1.0 / (x + 1.0)) - (1.0 / (x - 1.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (1.0d0 / (x + 1.0d0)) - (1.0d0 / (x - 1.0d0))
end function

Java

public static double code(double x) {
	return (1.0 / (x + 1.0)) - (1.0 / (x - 1.0));
}

Python

def code(x):
	return (1.0 / (x + 1.0)) - (1.0 / (x - 1.0))

Julia

function code(x)
	return Float64(Float64(1.0 / Float64(x + 1.0)) - Float64(1.0 / Float64(x - 1.0)))
end

MATLAB

function tmp = code(x)
	tmp = (1.0 / (x + 1.0)) - (1.0 / (x - 1.0));
end

Wolfram

code[x_] := N[(N[(1.0 / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] - N[(1.0 / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \frac{-2}{\mathsf{fma}\left(x, x, -1\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ -2.0 (fma x x -1.0)))

C

double code(double x) {
	return -2.0 / fma(x, x, -1.0);
}

Julia

function code(x)
	return Float64(-2.0 / fma(x, x, -1.0))
end

Wolfram

code[x_] := N[(-2.0 / N[(x * x + -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 76.7%

   \[\frac{1}{x + 1} - \frac{1}{x - 1} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. frac-sub N/A

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

   5. lift-+.f64 N/A

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

   6. lift--.f64 N/A

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

   7. difference-of-squares-rev N/A

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

   8. lower-/.f64 N/A

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

   9. *-lft-identity N/A

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

   10. cancel-sub-sign-inv N/A

       \[\leadsto \frac{\color{blue}{\left(x - 1\right) + \left(\mathsf{neg}\left(\left(x + 1\right)\right)\right) \cdot 1}}{x \cdot x - 1 \cdot 1} \]

   11. *-rgt-identity N/A

       \[\leadsto \frac{\left(x - 1\right) + \color{blue}{\left(\mathsf{neg}\left(\left(x + 1\right)\right)\right)}}{x \cdot x - 1 \cdot 1} \]

   12. sub-neg N/A

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

   13. lift-+.f64 N/A

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

   14. associate--r+ N/A

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

   15. lower--.f64 N/A

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

   16. lower--.f64 N/A

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

   17. difference-of-squares-rev N/A

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

   18. difference-of-sqr--1-rev N/A

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

   19. lower-fma.f64 80.7

       \[\leadsto \frac{\left(\left(x - 1\right) - x\right) - 1}{\color{blue}{\mathsf{fma}\left(x, x, -1\right)}} \]

4. Applied rewrites 80.7%

   \[\leadsto \color{blue}{\frac{\left(\left(x - 1\right) - x\right) - 1}{\mathsf{fma}\left(x, x, -1\right)}} \]

5. Taylor expanded in x around 0

   \[\leadsto \frac{\color{blue}{-2}}{\mathsf{fma}\left(x, x, -1\right)} \]
6. Step-by-step derivation

7. Applied rewrites 99.7%

   \[\leadsto \frac{\color{blue}{-2}}{\mathsf{fma}\left(x, x, -1\right)} \]
8. Add Preprocessing

Alternative 2: 98.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{1}{1 + x} - \frac{1}{x - 1} \leq 0:\\ \;\;\;\;\frac{-2}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x \cdot x, 2, 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (- (/ 1.0 (+ 1.0 x)) (/ 1.0 (- x 1.0))) 0.0)
   (/ -2.0 (* x x))
   (fma (* x x) 2.0 2.0)))

C

double code(double x) {
	double tmp;
	if (((1.0 / (1.0 + x)) - (1.0 / (x - 1.0))) <= 0.0) {
		tmp = -2.0 / (x * x);
	} else {
		tmp = fma((x * x), 2.0, 2.0);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(1.0 / Float64(1.0 + x)) - Float64(1.0 / Float64(x - 1.0))) <= 0.0)
		tmp = Float64(-2.0 / Float64(x * x));
	else
		tmp = fma(Float64(x * x), 2.0, 2.0);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[(1.0 / N[(1.0 + x), $MachinePrecision]), $MachinePrecision] - N[(1.0 / N[(x - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0], N[(-2.0 / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(N[(x * x), $MachinePrecision] * 2.0 + 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64)))) < 0.0

   1. Initial program 56.1%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{-2}{{x}^{2}}} \]
   4. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{-2}{{x}^{2}}} \]

      2. unpow2 N/A

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

      3. lower-*.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if 0.0 < (-.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))))

   1. Initial program 100.0%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{2 + 2 \cdot {x}^{2}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{2 \cdot {x}^{2} + 2} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{{x}^{2} \cdot 2} + 2 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{2}, 2, 2\right)} \]

      4. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot x}, 2, 2\right) \]

      5. lower-*.f64 100.0

         \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot x}, 2, 2\right) \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot x, 2, 2\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{1}{1 + x} - \frac{1}{x - 1} \leq 0:\\ \;\;\;\;\frac{-2}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x \cdot x, 2, 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 51.3% accurate, 32.0× speedup

Math

\[\begin{array}{l} \\ 2 \end{array} \]

FPCore

(FPCore (x) :precision binary64 2.0)

C

double code(double x) {
	return 2.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 2.0d0
end function

Java

public static double code(double x) {
	return 2.0;
}

Python

def code(x):
	return 2.0

Julia

function code(x)
	return 2.0
end

MATLAB

function tmp = code(x)
	tmp = 2.0;
end

Wolfram

code[x_] := 2.0

Derivation

1. Initial program 76.7%

   \[\frac{1}{x + 1} - \frac{1}{x - 1} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{2} \]
4. Step-by-step derivation

5. Applied rewrites 48.2%

   \[\leadsto \color{blue}{2} \]
6. Add Preprocessing

Reproduce

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