Numeric.Integration.TanhSinh:nonNegative from integration-0.2.1

Percentage Accurate: 100.0% → 100.0%

Time: 2.2s

Alternatives: 4

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 2: 98.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.35 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;-1 + \frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -1.35) (not (<= x 1.0))) (+ -1.0 (/ -1.0 x)) x))

C

double code(double x) {
	double tmp;
	if ((x <= -1.35) || !(x <= 1.0)) {
		tmp = -1.0 + (-1.0 / x);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-1.35d0)) .or. (.not. (x <= 1.0d0))) then
        tmp = (-1.0d0) + ((-1.0d0) / x)
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -1.35) || !(x <= 1.0)) {
		tmp = -1.0 + (-1.0 / x);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -1.35) or not (x <= 1.0):
		tmp = -1.0 + (-1.0 / x)
	else:
		tmp = x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -1.35) || !(x <= 1.0))
		tmp = Float64(-1.0 + Float64(-1.0 / x));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -1.35) || ~((x <= 1.0)))
		tmp = -1.0 + (-1.0 / x);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -1.35], N[Not[LessEqual[x, 1.0]], $MachinePrecision]], N[(-1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if x < -1.3500000000000001 or 1 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 99.1%

      \[\leadsto \color{blue}{-1 \cdot \left(1 + \frac{1}{x}\right)} \]
   4. Step-by-step derivation

      1. distribute-rgt-in 99.1%

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

      2. metadata-eval 99.1%

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

      3. associate-*l/ 99.1%

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

      4. metadata-eval 99.1%

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

   5. Simplified 99.1%

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

   if -1.3500000000000001 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 98.1%

      \[\leadsto \color{blue}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.35 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;-1 + \frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x -1.0) -1.0 (if (<= x 1.0) x -1.0)))

C

double code(double x) {
	double tmp;
	if (x <= -1.0) {
		tmp = -1.0;
	} else if (x <= 1.0) {
		tmp = x;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.0d0)) then
        tmp = -1.0d0
    else if (x <= 1.0d0) then
        tmp = x
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.0) {
		tmp = -1.0;
	} else if (x <= 1.0) {
		tmp = x;
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.0:
		tmp = -1.0
	elif x <= 1.0:
		tmp = x
	else:
		tmp = -1.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.0)
		tmp = -1.0;
	elseif (x <= 1.0)
		tmp = x;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.0)
		tmp = -1.0;
	elseif (x <= 1.0)
		tmp = x;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.0], -1.0, If[LessEqual[x, 1.0], x, -1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 98.2%

      \[\leadsto \color{blue}{-1} \]

   if -1 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 98.1%

      \[\leadsto \color{blue}{x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 50.3% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (x) :precision binary64 -1.0)

C

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

Fortran

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

Java

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

Python

def code(x):
	return -1.0

Julia

function code(x)
	return -1.0
end

MATLAB

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

Wolfram

code[x_] := -1.0

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around inf 47.0%

   \[\leadsto \color{blue}{-1} \]
4. Add Preprocessing

Reproduce

herbie shell --seed 2024135 
(FPCore (x)
  :name "Numeric.Integration.TanhSinh:nonNegative from integration-0.2.1"
  :precision binary64
  (/ x (- 1.0 x)))