VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 8.7s

Alternatives: 10

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	return -(x * (1.0 / tan(B))) + (1.0 / sin(B));
}

Fortran

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

Java

public static double code(double B, double x) {
	return -(x * (1.0 / Math.tan(B))) + (1.0 / Math.sin(B));
}

Python

def code(B, x):
	return -(x * (1.0 / math.tan(B))) + (1.0 / math.sin(B))

Julia

function code(B, x)
	return Float64(Float64(-Float64(x * Float64(1.0 / tan(B)))) + Float64(1.0 / sin(B)))
end

MATLAB

function tmp = code(B, x)
	tmp = -(x * (1.0 / tan(B))) + (1.0 / sin(B));
end

Wolfram

code[B_, x_] := N[((-N[(x * N[(1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	return -(x * (1.0 / tan(B))) + (1.0 / sin(B));
}

Fortran

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

Java

public static double code(double B, double x) {
	return -(x * (1.0 / Math.tan(B))) + (1.0 / Math.sin(B));
}

Python

def code(B, x):
	return -(x * (1.0 / math.tan(B))) + (1.0 / math.sin(B))

Julia

function code(B, x)
	return Float64(Float64(-Float64(x * Float64(1.0 / tan(B)))) + Float64(1.0 / sin(B)))
end

MATLAB

function tmp = code(B, x)
	tmp = -(x * (1.0 / tan(B))) + (1.0 / sin(B));
end

Wolfram

code[B_, x_] := N[((-N[(x * N[(1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (B x) :precision binary64 (- (/ 1.0 (sin B)) (/ x (tan B))))

C

double code(double B, double x) {
	return (1.0 / sin(B)) - (x / tan(B));
}

Fortran

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

Java

public static double code(double B, double x) {
	return (1.0 / Math.sin(B)) - (x / Math.tan(B));
}

Python

def code(B, x):
	return (1.0 / math.sin(B)) - (x / math.tan(B))

Julia

function code(B, x)
	return Float64(Float64(1.0 / sin(B)) - Float64(x / tan(B)))
end

MATLAB

function tmp = code(B, x)
	tmp = (1.0 / sin(B)) - (x / tan(B));
end

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Step-by-step derivation

   1. +-commutative 99.7%

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

   2. unsub-neg 99.7%

      \[\leadsto \color{blue}{\frac{1}{\sin B} - x \cdot \frac{1}{\tan B}} \]

   3. associate-*r/ 99.7%

      \[\leadsto \frac{1}{\sin B} - \color{blue}{\frac{x \cdot 1}{\tan B}} \]

   4. *-rgt-identity 99.7%

      \[\leadsto \frac{1}{\sin B} - \frac{\color{blue}{x}}{\tan B} \]

3. Simplified 99.7%

   \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x}{\tan B}} \]

4. Final simplification 99.7%

   \[\leadsto \frac{1}{\sin B} - \frac{x}{\tan B} \]

Alternative 2: 98.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.6 \cdot 10^{-13}:\\ \;\;\;\;\frac{1}{B} - \frac{x}{\tan B}\\ \mathbf{elif}\;x \leq 8.2 \cdot 10^{-8}:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{\frac{1}{x} + -1}{\tan B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (<= x -1.6e-13)
   (- (/ 1.0 B) (/ x (tan B)))
   (if (<= x 8.2e-8) (/ 1.0 (sin B)) (* x (/ (+ (/ 1.0 x) -1.0) (tan B))))))

C

double code(double B, double x) {
	double tmp;
	if (x <= -1.6e-13) {
		tmp = (1.0 / B) - (x / tan(B));
	} else if (x <= 8.2e-8) {
		tmp = 1.0 / sin(B);
	} else {
		tmp = x * (((1.0 / x) + -1.0) / tan(B));
	}
	return tmp;
}

Fortran

real(8) function code(b, x)
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.6d-13)) then
        tmp = (1.0d0 / b) - (x / tan(b))
    else if (x <= 8.2d-8) then
        tmp = 1.0d0 / sin(b)
    else
        tmp = x * (((1.0d0 / x) + (-1.0d0)) / tan(b))
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if (x <= -1.6e-13) {
		tmp = (1.0 / B) - (x / Math.tan(B));
	} else if (x <= 8.2e-8) {
		tmp = 1.0 / Math.sin(B);
	} else {
		tmp = x * (((1.0 / x) + -1.0) / Math.tan(B));
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if x <= -1.6e-13:
		tmp = (1.0 / B) - (x / math.tan(B))
	elif x <= 8.2e-8:
		tmp = 1.0 / math.sin(B)
	else:
		tmp = x * (((1.0 / x) + -1.0) / math.tan(B))
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if (x <= -1.6e-13)
		tmp = Float64(Float64(1.0 / B) - Float64(x / tan(B)));
	elseif (x <= 8.2e-8)
		tmp = Float64(1.0 / sin(B));
	else
		tmp = Float64(x * Float64(Float64(Float64(1.0 / x) + -1.0) / tan(B)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if (x <= -1.6e-13)
		tmp = (1.0 / B) - (x / tan(B));
	elseif (x <= 8.2e-8)
		tmp = 1.0 / sin(B);
	else
		tmp = x * (((1.0 / x) + -1.0) / tan(B));
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[LessEqual[x, -1.6e-13], N[(N[(1.0 / B), $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8.2e-8], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(N[(1.0 / x), $MachinePrecision] + -1.0), $MachinePrecision] / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.6e-13

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. +-commutative 99.6%

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

      2. unsub-neg 99.6%

         \[\leadsto \color{blue}{\frac{1}{\sin B} - x \cdot \frac{1}{\tan B}} \]

      3. associate-*r/ 99.7%

         \[\leadsto \frac{1}{\sin B} - \color{blue}{\frac{x \cdot 1}{\tan B}} \]

      4. *-rgt-identity 99.7%

         \[\leadsto \frac{1}{\sin B} - \frac{\color{blue}{x}}{\tan B} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x}{\tan B}} \]

   4. Taylor expanded in B around 0 98.2%

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

   if -1.6e-13 < x < 8.20000000000000063e-8

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. distribute-lft-neg-in 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 99.4%

      \[\leadsto \color{blue}{\frac{1}{\sin B}} \]

   if 8.20000000000000063e-8 < x

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. distribute-lft-neg-in 99.6%

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

   3. Simplified 99.6%

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

      1. +-commutative 99.6%

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

      2. cancel-sign-sub-inv 99.6%

         \[\leadsto \color{blue}{\frac{1}{\sin B} - x \cdot \frac{1}{\tan B}} \]

      3. div-inv 99.7%

         \[\leadsto \frac{1}{\sin B} - \color{blue}{\frac{x}{\tan B}} \]

      4. clear-num 99.6%

         \[\leadsto \frac{1}{\sin B} - \color{blue}{\frac{1}{\frac{\tan B}{x}}} \]

      5. frac-sub 90.0%

         \[\leadsto \color{blue}{\frac{1 \cdot \frac{\tan B}{x} - \sin B \cdot 1}{\sin B \cdot \frac{\tan B}{x}}} \]

      6. *-un-lft-identity 90.0%

         \[\leadsto \frac{\color{blue}{\frac{\tan B}{x}} - \sin B \cdot 1}{\sin B \cdot \frac{\tan B}{x}} \]

      7. *-commutative 90.0%

         \[\leadsto \frac{\frac{\tan B}{x} - \color{blue}{1 \cdot \sin B}}{\sin B \cdot \frac{\tan B}{x}} \]

      8. *-un-lft-identity 90.0%

         \[\leadsto \frac{\frac{\tan B}{x} - \color{blue}{\sin B}}{\sin B \cdot \frac{\tan B}{x}} \]

   5. Applied egg-rr 90.0%

      \[\leadsto \color{blue}{\frac{\frac{\tan B}{x} - \sin B}{\sin B \cdot \frac{\tan B}{x}}} \]
   6. Step-by-step derivation

      1. associate-/r* 99.6%

         \[\leadsto \color{blue}{\frac{\frac{\frac{\tan B}{x} - \sin B}{\sin B}}{\frac{\tan B}{x}}} \]

      2. associate-/r/ 99.6%

         \[\leadsto \color{blue}{\frac{\frac{\frac{\tan B}{x} - \sin B}{\sin B}}{\tan B} \cdot x} \]

      3. div-sub 99.6%

         \[\leadsto \frac{\color{blue}{\frac{\frac{\tan B}{x}}{\sin B} - \frac{\sin B}{\sin B}}}{\tan B} \cdot x \]

      4. *-inverses 99.6%

         \[\leadsto \frac{\frac{\frac{\tan B}{x}}{\sin B} - \color{blue}{1}}{\tan B} \cdot x \]

   7. Simplified 99.6%

      \[\leadsto \color{blue}{\frac{\frac{\frac{\tan B}{x}}{\sin B} - 1}{\tan B} \cdot x} \]

   8. Taylor expanded in B around 0 97.3%

      \[\leadsto \frac{\color{blue}{\frac{1}{x}} - 1}{\tan B} \cdot x \]
3. Recombined 3 regimes into one program.

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.6 \cdot 10^{-13}:\\ \;\;\;\;\frac{1}{B} - \frac{x}{\tan B}\\ \mathbf{elif}\;x \leq 8.2 \cdot 10^{-8}:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{\frac{1}{x} + -1}{\tan B}\\ \end{array} \]

Alternative 3: 98.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.6 \cdot 10^{-13} \lor \neg \left(x \leq 3.5 \cdot 10^{-6}\right):\\ \;\;\;\;\frac{1}{B} - \frac{x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -1.6e-13) (not (<= x 3.5e-6)))
   (- (/ 1.0 B) (/ x (tan B)))
   (/ 1.0 (sin B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -1.6e-13) || !(x <= 3.5e-6)) {
		tmp = (1.0 / B) - (x / tan(B));
	} else {
		tmp = 1.0 / sin(B);
	}
	return tmp;
}

Fortran

real(8) function code(b, x)
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-1.6d-13)) .or. (.not. (x <= 3.5d-6))) then
        tmp = (1.0d0 / b) - (x / tan(b))
    else
        tmp = 1.0d0 / sin(b)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -1.6e-13) || !(x <= 3.5e-6)) {
		tmp = (1.0 / B) - (x / Math.tan(B));
	} else {
		tmp = 1.0 / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -1.6e-13) or not (x <= 3.5e-6):
		tmp = (1.0 / B) - (x / math.tan(B))
	else:
		tmp = 1.0 / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -1.6e-13) || !(x <= 3.5e-6))
		tmp = Float64(Float64(1.0 / B) - Float64(x / tan(B)));
	else
		tmp = Float64(1.0 / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -1.6e-13) || ~((x <= 3.5e-6)))
		tmp = (1.0 / B) - (x / tan(B));
	else
		tmp = 1.0 / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -1.6e-13], N[Not[LessEqual[x, 3.5e-6]], $MachinePrecision]], N[(N[(1.0 / B), $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.6e-13 or 3.49999999999999995e-6 < x

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. +-commutative 99.6%

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

      2. unsub-neg 99.6%

         \[\leadsto \color{blue}{\frac{1}{\sin B} - x \cdot \frac{1}{\tan B}} \]

      3. associate-*r/ 99.7%

         \[\leadsto \frac{1}{\sin B} - \color{blue}{\frac{x \cdot 1}{\tan B}} \]

      4. *-rgt-identity 99.7%

         \[\leadsto \frac{1}{\sin B} - \frac{\color{blue}{x}}{\tan B} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x}{\tan B}} \]

   4. Taylor expanded in B around 0 97.8%

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

   if -1.6e-13 < x < 3.49999999999999995e-6

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. distribute-lft-neg-in 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 99.4%

      \[\leadsto \color{blue}{\frac{1}{\sin B}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.6 \cdot 10^{-13} \lor \neg \left(x \leq 3.5 \cdot 10^{-6}\right):\\ \;\;\;\;\frac{1}{B} - \frac{x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \]

Alternative 4: 97.8% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -1.15) (not (<= x 1.0))) (/ (- x) (tan B)) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -1.15) || !(x <= 1.0)) {
		tmp = -x / tan(B);
	} else {
		tmp = 1.0 / sin(B);
	}
	return tmp;
}

Fortran

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

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -1.15) || !(x <= 1.0)) {
		tmp = -x / Math.tan(B);
	} else {
		tmp = 1.0 / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -1.15) or not (x <= 1.0):
		tmp = -x / math.tan(B)
	else:
		tmp = 1.0 / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -1.15) || !(x <= 1.0))
		tmp = Float64(Float64(-x) / tan(B));
	else
		tmp = Float64(1.0 / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -1.15) || ~((x <= 1.0)))
		tmp = -x / tan(B);
	else
		tmp = 1.0 / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -1.15], N[Not[LessEqual[x, 1.0]], $MachinePrecision]], N[((-x) / N[Tan[B], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.1499999999999999 or 1 < x

   1. Initial program 99.7%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. +-commutative 99.7%

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

      2. unsub-neg 99.7%

         \[\leadsto \color{blue}{\frac{1}{\sin B} - x \cdot \frac{1}{\tan B}} \]

      3. associate-*r/ 99.7%

         \[\leadsto \frac{1}{\sin B} - \color{blue}{\frac{x \cdot 1}{\tan B}} \]

      4. *-rgt-identity 99.7%

         \[\leadsto \frac{1}{\sin B} - \frac{\color{blue}{x}}{\tan B} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x}{\tan B}} \]

   4. Taylor expanded in x around 0 99.7%

      \[\leadsto \frac{1}{\sin B} - \color{blue}{\frac{\cos B \cdot x}{\sin B}} \]

   5. Taylor expanded in x around inf 97.3%

      \[\leadsto \color{blue}{-1 \cdot \frac{\cos B \cdot x}{\sin B}} \]
   6. Step-by-step derivation

      1. clear-num 97.2%

         \[\leadsto -1 \cdot \color{blue}{\frac{1}{\frac{\sin B}{\cos B \cdot x}}} \]

      2. /-rgt-identity 97.2%

         \[\leadsto -1 \cdot \frac{1}{\frac{\color{blue}{\frac{\sin B}{1}}}{\cos B \cdot x}} \]

      3. div-inv 97.2%

         \[\leadsto -1 \cdot \frac{1}{\frac{\color{blue}{\sin B \cdot \frac{1}{1}}}{\cos B \cdot x}} \]

      4. metadata-eval 97.2%

         \[\leadsto -1 \cdot \frac{1}{\frac{\sin B \cdot \color{blue}{1}}{\cos B \cdot x}} \]

      5. frac-times 97.1%

         \[\leadsto -1 \cdot \frac{1}{\color{blue}{\frac{\sin B}{\cos B} \cdot \frac{1}{x}}} \]

      6. tan-quot 97.1%

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

      7. div-inv 97.3%

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

      8. clear-num 97.4%

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

      9. div-inv 97.3%

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

      10. add-sqr-sqrt 42.9%

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

      11. sqrt-unprod 29.9%

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

      12. sqr-neg 29.9%

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

      13. sqrt-unprod 0.3%

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

      14. add-sqr-sqrt 0.5%

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

      15. expm1-log1p-u 0.2%

          \[\leadsto -1 \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\left(-x\right) \cdot \frac{1}{\tan B}\right)\right)} \]

      16. expm1-udef 0.2%

          \[\leadsto -1 \cdot \color{blue}{\left(e^{\mathsf{log1p}\left(\left(-x\right) \cdot \frac{1}{\tan B}\right)} - 1\right)} \]

   7. Applied egg-rr 44.5%

      \[\leadsto -1 \cdot \color{blue}{\left(e^{\mathsf{log1p}\left(\frac{x}{\tan B}\right)} - 1\right)} \]
   8. Step-by-step derivation

      1. expm1-def 44.5%

         \[\leadsto -1 \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{x}{\tan B}\right)\right)} \]

      2. expm1-log1p 97.4%

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

   9. Simplified 97.4%

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

   if -1.1499999999999999 < x < 1

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. distribute-lft-neg-in 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 98.7%

      \[\leadsto \color{blue}{\frac{1}{\sin B}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.15 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;\frac{-x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \]

Alternative 5: 74.8% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1 - x}{B}\\ \mathbf{if}\;x \leq -1.6 \cdot 10^{-13}:\\ \;\;\;\;B \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right) + t_0\\ \mathbf{elif}\;x \leq 8.5 \cdot 10^{-6}:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;t_0 + 0.3333333333333333 \cdot \left(B \cdot x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (let* ((t_0 (/ (- 1.0 x) B)))
   (if (<= x -1.6e-13)
     (+ (* B (+ 0.16666666666666666 (* x 0.3333333333333333))) t_0)
     (if (<= x 8.5e-6)
       (/ 1.0 (sin B))
       (+ t_0 (* 0.3333333333333333 (* B x)))))))

C

double code(double B, double x) {
	double t_0 = (1.0 - x) / B;
	double tmp;
	if (x <= -1.6e-13) {
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + t_0;
	} else if (x <= 8.5e-6) {
		tmp = 1.0 / sin(B);
	} else {
		tmp = t_0 + (0.3333333333333333 * (B * x));
	}
	return tmp;
}

Fortran

real(8) function code(b, x)
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (1.0d0 - x) / b
    if (x <= (-1.6d-13)) then
        tmp = (b * (0.16666666666666666d0 + (x * 0.3333333333333333d0))) + t_0
    else if (x <= 8.5d-6) then
        tmp = 1.0d0 / sin(b)
    else
        tmp = t_0 + (0.3333333333333333d0 * (b * x))
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double t_0 = (1.0 - x) / B;
	double tmp;
	if (x <= -1.6e-13) {
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + t_0;
	} else if (x <= 8.5e-6) {
		tmp = 1.0 / Math.sin(B);
	} else {
		tmp = t_0 + (0.3333333333333333 * (B * x));
	}
	return tmp;
}

Python

def code(B, x):
	t_0 = (1.0 - x) / B
	tmp = 0
	if x <= -1.6e-13:
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + t_0
	elif x <= 8.5e-6:
		tmp = 1.0 / math.sin(B)
	else:
		tmp = t_0 + (0.3333333333333333 * (B * x))
	return tmp

Julia

function code(B, x)
	t_0 = Float64(Float64(1.0 - x) / B)
	tmp = 0.0
	if (x <= -1.6e-13)
		tmp = Float64(Float64(B * Float64(0.16666666666666666 + Float64(x * 0.3333333333333333))) + t_0);
	elseif (x <= 8.5e-6)
		tmp = Float64(1.0 / sin(B));
	else
		tmp = Float64(t_0 + Float64(0.3333333333333333 * Float64(B * x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	t_0 = (1.0 - x) / B;
	tmp = 0.0;
	if (x <= -1.6e-13)
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + t_0;
	elseif (x <= 8.5e-6)
		tmp = 1.0 / sin(B);
	else
		tmp = t_0 + (0.3333333333333333 * (B * x));
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := Block[{t$95$0 = N[(N[(1.0 - x), $MachinePrecision] / B), $MachinePrecision]}, If[LessEqual[x, -1.6e-13], N[(N[(B * N[(0.16666666666666666 + N[(x * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision], If[LessEqual[x, 8.5e-6], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision], N[(t$95$0 + N[(0.3333333333333333 * N[(B * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.6e-13

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. distribute-lft-neg-in 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in B around 0 47.5%

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

      1. +-commutative 47.5%

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

      2. mul-1-neg 47.5%

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

      3. sub-neg 47.5%

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

      4. associate--l+ 47.5%

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

      5. *-commutative 47.5%

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

      6. *-commutative 47.5%

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

      7. div-sub 47.6%

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

   6. Simplified 47.6%

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

   if -1.6e-13 < x < 8.4999999999999999e-6

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. distribute-lft-neg-in 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 99.4%

      \[\leadsto \color{blue}{\frac{1}{\sin B}} \]

   if 8.4999999999999999e-6 < x

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. distribute-lft-neg-in 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in B around 0 97.3%

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

   5. Taylor expanded in B around 0 48.1%

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

      1. +-commutative 48.1%

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

      2. associate-+l+ 48.1%

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

      3. *-commutative 48.1%

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

      4. mul-1-neg 48.1%

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

      5. sub-neg 48.1%

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

      6. div-sub 48.2%

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

   7. Simplified 48.2%

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

4. Final simplification 70.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.6 \cdot 10^{-13}:\\ \;\;\;\;B \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right) + \frac{1 - x}{B}\\ \mathbf{elif}\;x \leq 8.5 \cdot 10^{-6}:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - x}{B} + 0.3333333333333333 \cdot \left(B \cdot x\right)\\ \end{array} \]

Alternative 6: 52.3% accurate, 19.1× speedup

Math

\[\begin{array}{l} \\ \frac{1 - x}{B} + 0.3333333333333333 \cdot \left(B \cdot x\right) \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (+ (/ (- 1.0 x) B) (* 0.3333333333333333 (* B x))))

C

double code(double B, double x) {
	return ((1.0 - x) / B) + (0.3333333333333333 * (B * x));
}

Fortran

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

Java

public static double code(double B, double x) {
	return ((1.0 - x) / B) + (0.3333333333333333 * (B * x));
}

Python

def code(B, x):
	return ((1.0 - x) / B) + (0.3333333333333333 * (B * x))

Julia

function code(B, x)
	return Float64(Float64(Float64(1.0 - x) / B) + Float64(0.3333333333333333 * Float64(B * x)))
end

MATLAB

function tmp = code(B, x)
	tmp = ((1.0 - x) / B) + (0.3333333333333333 * (B * x));
end

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Step-by-step derivation

   1. distribute-lft-neg-in 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in B around 0 76.9%

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

5. Taylor expanded in B around 0 48.3%

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

   1. +-commutative 48.3%

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

   2. associate-+l+ 48.3%

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

   3. *-commutative 48.3%

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

   4. mul-1-neg 48.3%

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

   5. sub-neg 48.3%

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

   6. div-sub 48.3%

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

7. Simplified 48.3%

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

8. Final simplification 48.3%

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

Alternative 7: 52.2% accurate, 23.3× speedup

Math

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

FPCore

(FPCore (B x)
 :precision binary64
 (+ (/ (- 1.0 x) B) (* B 0.16666666666666666)))

C

double code(double B, double x) {
	return ((1.0 - x) / B) + (B * 0.16666666666666666);
}

Fortran

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

Java

public static double code(double B, double x) {
	return ((1.0 - x) / B) + (B * 0.16666666666666666);
}

Python

def code(B, x):
	return ((1.0 - x) / B) + (B * 0.16666666666666666)

Julia

function code(B, x)
	return Float64(Float64(Float64(1.0 - x) / B) + Float64(B * 0.16666666666666666))
end

MATLAB

function tmp = code(B, x)
	tmp = ((1.0 - x) / B) + (B * 0.16666666666666666);
end

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Step-by-step derivation

   1. distribute-lft-neg-in 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in B around 0 48.3%

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

   1. +-commutative 48.3%

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

   2. mul-1-neg 48.3%

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

   3. sub-neg 48.3%

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

   4. associate--l+ 48.3%

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

   5. *-commutative 48.3%

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

   6. *-commutative 48.3%

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

   7. div-sub 48.3%

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

6. Simplified 48.3%

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

7. Taylor expanded in x around 0 48.0%

   \[\leadsto \color{blue}{0.16666666666666666 \cdot B} + \frac{1 - x}{B} \]
8. Step-by-step derivation

   1. *-commutative 48.0%

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

9. Simplified 48.0%

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

10. Final simplification 48.0%

    \[\leadsto \frac{1 - x}{B} + B \cdot 0.16666666666666666 \]

Alternative 8: 50.9% accurate, 25.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 99.7%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. +-commutative 99.7%

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

      2. unsub-neg 99.7%

         \[\leadsto \color{blue}{\frac{1}{\sin B} - x \cdot \frac{1}{\tan B}} \]

      3. associate-*r/ 99.7%

         \[\leadsto \frac{1}{\sin B} - \color{blue}{\frac{x \cdot 1}{\tan B}} \]

      4. *-rgt-identity 99.7%

         \[\leadsto \frac{1}{\sin B} - \frac{\color{blue}{x}}{\tan B} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x}{\tan B}} \]

   4. Taylor expanded in x around 0 99.7%

      \[\leadsto \frac{1}{\sin B} - \color{blue}{\frac{\cos B \cdot x}{\sin B}} \]

   5. Taylor expanded in x around inf 97.3%

      \[\leadsto \color{blue}{-1 \cdot \frac{\cos B \cdot x}{\sin B}} \]

   6. Taylor expanded in B around 0 45.8%

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

   if -1 < x < 1

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Step-by-step derivation

      1. distribute-lft-neg-in 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in B around 0 50.2%

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

   5. Taylor expanded in x around 0 48.9%

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

4. Final simplification 47.1%

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

Alternative 9: 52.0% accurate, 42.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Step-by-step derivation

   1. distribute-lft-neg-in 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in B around 0 47.7%

   \[\leadsto \color{blue}{\frac{1 + -1 \cdot x}{B}} \]
5. Step-by-step derivation

   1. mul-1-neg 47.7%

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

   2. sub-neg 47.7%

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

6. Simplified 47.7%

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

7. Final simplification 47.7%

   \[\leadsto \frac{1 - x}{B} \]

Alternative 10: 27.5% accurate, 70.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{B} \end{array} \]

FPCore

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

C

double code(double B, double x) {
	return 1.0 / B;
}

Fortran

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

Java

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

Python

def code(B, x):
	return 1.0 / B

Julia

function code(B, x)
	return Float64(1.0 / B)
end

MATLAB

function tmp = code(B, x)
	tmp = 1.0 / B;
end

Wolfram

code[B_, x_] := N[(1.0 / B), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Step-by-step derivation

   1. distribute-lft-neg-in 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in B around 0 76.9%

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

5. Taylor expanded in x around 0 23.1%

   \[\leadsto \color{blue}{\frac{1}{B}} \]

6. Final simplification 23.1%

   \[\leadsto \frac{1}{B} \]

Reproduce

herbie shell --seed 2023250 
(FPCore (B x)
  :name "VandenBroeck and Keller, Equation (24)"
  :precision binary64
  (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))