VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 8.2s

Alternatives: 9

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. distribute-lft-neg-in 99.7%

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

   2. +-commutative 99.7%

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

   3. cancel-sign-sub-inv 99.7%

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

   4. reciprocal-define 67.8%

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

   5. associate-*r/ 67.9%

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

   6. *-rgt-identity 67.9%

      \[\leadsto \mathsf{reciprocal}\left(\sin B\right) - \frac{\color{blue}{x}}{\tan B} \]

3. Simplified 67.9%

   \[\leadsto \color{blue}{\mathsf{reciprocal}\left(\sin B\right) - \frac{x}{\tan B}} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. reciprocal-define 99.8%

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

   2. frac-2neg 99.8%

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

   3. metadata-eval 99.8%

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

6. Applied egg-rr 99.8%

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

7. Taylor expanded in B around inf 99.8%

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

8. Final simplification 99.8%

   \[\leadsto \frac{1}{\sin B} - \frac{x}{\tan B} \]
9. Add Preprocessing

Alternative 2: 97.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-5} \lor \neg \left(x \leq 3.4 \cdot 10^{-28}\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 -2e-5) (not (<= x 3.4e-28)))
   (- (/ 1.0 B) (/ x (tan B)))
   (/ 1.0 (sin B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -2e-5) || !(x <= 3.4e-28)) {
		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 <= (-2d-5)) .or. (.not. (x <= 3.4d-28))) 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 <= -2e-5) || !(x <= 3.4e-28)) {
		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 <= -2e-5) or not (x <= 3.4e-28):
		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 <= -2e-5) || !(x <= 3.4e-28))
		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 <= -2e-5) || ~((x <= 3.4e-28)))
		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, -2e-5], N[Not[LessEqual[x, 3.4e-28]], $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 < -2.00000000000000016e-5 or 3.4000000000000001e-28 < x

   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} \]

      2. +-commutative 99.7%

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

      3. cancel-sign-sub-inv 99.7%

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

      4. reciprocal-define 96.4%

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

      5. associate-*r/ 96.5%

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

      6. *-rgt-identity 96.5%

         \[\leadsto \mathsf{reciprocal}\left(\sin B\right) - \frac{\color{blue}{x}}{\tan B} \]

   3. Simplified 96.5%

      \[\leadsto \color{blue}{\mathsf{reciprocal}\left(\sin B\right) - \frac{x}{\tan B}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. reciprocal-define 99.8%

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

      2. frac-2neg 99.8%

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

      3. metadata-eval 99.8%

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

   6. Applied egg-rr 99.8%

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

   7. Taylor expanded in B around 0 99.2%

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

   if -2.00000000000000016e-5 < x < 3.4000000000000001e-28

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 98.6%

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

4. Final simplification 98.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-5} \lor \neg \left(x \leq 3.4 \cdot 10^{-28}\right):\\ \;\;\;\;\frac{1}{B} - \frac{x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.6 \cdot 10^{+18} \lor \neg \left(x \leq 3.4 \cdot 10^{-28}\right):\\ \;\;\;\;\frac{1}{B} - \frac{x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B} - \frac{x}{B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -9.6e+18) (not (<= x 3.4e-28)))
   (- (/ 1.0 B) (/ x (tan B)))
   (- (/ 1.0 (sin B)) (/ x B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -9.6e+18) || !(x <= 3.4e-28)) {
		tmp = (1.0 / B) - (x / tan(B));
	} else {
		tmp = (1.0 / sin(B)) - (x / 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 <= (-9.6d+18)) .or. (.not. (x <= 3.4d-28))) then
        tmp = (1.0d0 / b) - (x / tan(b))
    else
        tmp = (1.0d0 / sin(b)) - (x / b)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -9.6e+18) || !(x <= 3.4e-28)) {
		tmp = (1.0 / B) - (x / Math.tan(B));
	} else {
		tmp = (1.0 / Math.sin(B)) - (x / B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -9.6e+18) or not (x <= 3.4e-28):
		tmp = (1.0 / B) - (x / math.tan(B))
	else:
		tmp = (1.0 / math.sin(B)) - (x / B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -9.6e+18) || !(x <= 3.4e-28))
		tmp = Float64(Float64(1.0 / B) - Float64(x / tan(B)));
	else
		tmp = Float64(Float64(1.0 / sin(B)) - Float64(x / B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -9.6e+18) || ~((x <= 3.4e-28)))
		tmp = (1.0 / B) - (x / tan(B));
	else
		tmp = (1.0 / sin(B)) - (x / B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -9.6e+18], N[Not[LessEqual[x, 3.4e-28]], $MachinePrecision]], N[(N[(1.0 / B), $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision] - N[(x / B), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -9.6e18 or 3.4000000000000001e-28 < x

   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} \]

      2. +-commutative 99.7%

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

      3. cancel-sign-sub-inv 99.7%

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

      4. reciprocal-define 96.7%

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

      5. associate-*r/ 96.9%

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

      6. *-rgt-identity 96.9%

         \[\leadsto \mathsf{reciprocal}\left(\sin B\right) - \frac{\color{blue}{x}}{\tan B} \]

   3. Simplified 96.9%

      \[\leadsto \color{blue}{\mathsf{reciprocal}\left(\sin B\right) - \frac{x}{\tan B}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. reciprocal-define 99.8%

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

      2. frac-2neg 99.8%

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

      3. metadata-eval 99.8%

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

   6. Applied egg-rr 99.8%

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

   7. Taylor expanded in B around 0 99.2%

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

   if -9.6e18 < x < 3.4000000000000001e-28

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0 99.1%

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

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -9.6 \cdot 10^{+18} \lor \neg \left(x \leq 3.4 \cdot 10^{-28}\right):\\ \;\;\;\;\frac{1}{B} - \frac{x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B} - \frac{x}{B}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 63.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq 10000:\\ \;\;\;\;B \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right) + \frac{1 - x}{B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (<= B 10000.0)
   (+ (* B (+ 0.16666666666666666 (* x 0.3333333333333333))) (/ (- 1.0 x) B))
   (/ 1.0 (sin B))))

C

double code(double B, double x) {
	double tmp;
	if (B <= 10000.0) {
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + ((1.0 - x) / 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 (b <= 10000.0d0) then
        tmp = (b * (0.16666666666666666d0 + (x * 0.3333333333333333d0))) + ((1.0d0 - x) / 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 (B <= 10000.0) {
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + ((1.0 - x) / B);
	} else {
		tmp = 1.0 / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if B <= 10000.0:
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + ((1.0 - x) / B)
	else:
		tmp = 1.0 / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if (B <= 10000.0)
		tmp = Float64(Float64(B * Float64(0.16666666666666666 + Float64(x * 0.3333333333333333))) + Float64(Float64(1.0 - x) / B));
	else
		tmp = Float64(1.0 / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if (B <= 10000.0)
		tmp = (B * (0.16666666666666666 + (x * 0.3333333333333333))) + ((1.0 - x) / B);
	else
		tmp = 1.0 / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 1e4

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0 67.7%

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

      1. associate--l+ 67.7%

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

      2. *-commutative 67.7%

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

      3. div-sub 67.7%

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

   5. Simplified 67.7%

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

   if 1e4 < B

   1. Initial program 99.7%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 54.6%

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

4. Final simplification 64.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;B \leq 10000:\\ \;\;\;\;B \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right) + \frac{1 - x}{B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 50.8% accurate, 14.9× speedup

Math

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

FPCore

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

C

double code(double B, double x) {
	double tmp;
	if ((x <= -1.25e-8) || !(x <= 29.5)) {
		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.25d-8)) .or. (.not. (x <= 29.5d0))) 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.25e-8) || !(x <= 29.5)) {
		tmp = -x / B;
	} else {
		tmp = 1.0 / B;
	}
	return tmp;
}

Python

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

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -1.25e-8) || !(x <= 29.5))
		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.25e-8) || ~((x <= 29.5)))
		tmp = -x / B;
	else
		tmp = 1.0 / B;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.2499999999999999e-8 or 29.5 < x

   1. Initial program 99.7%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0 55.8%

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

   4. Taylor expanded in x around inf 54.6%

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

      1. associate-*r/ 54.6%

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

      2. neg-mul-1 54.6%

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

   6. Simplified 54.6%

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

   if -1.2499999999999999e-8 < x < 29.5

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0 48.9%

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

      1. clear-num 48.9%

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

      2. inv-pow 48.9%

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

   5. Applied egg-rr 48.9%

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

   6. Taylor expanded in x around 0 47.8%

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

4. Final simplification 51.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.25 \cdot 10^{-8} \lor \neg \left(x \leq 29.5\right):\\ \;\;\;\;\frac{-x}{B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{B}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 51.9% 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. Add Preprocessing

3. Taylor expanded in B around 0 78.8%

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

4. Taylor expanded in B around 0 52.3%

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

   1. associate--l+ 52.3%

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

   2. *-commutative 52.3%

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

   3. div-sub 52.3%

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

6. Simplified 52.3%

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

7. Final simplification 52.3%

   \[\leadsto \frac{1 - x}{B} + B \cdot 0.16666666666666666 \]
8. Add Preprocessing

Alternative 7: 51.8% 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. Add Preprocessing

3. Taylor expanded in B around 0 52.2%

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

4. Final simplification 52.2%

   \[\leadsto \frac{1 - x}{B} \]
5. Add Preprocessing

Alternative 8: 3.1% accurate, 70.0× speedup

Math

\[\begin{array}{l} \\ B \cdot 0.16666666666666666 \end{array} \]

FPCore

(FPCore (B x) :precision binary64 (* B 0.16666666666666666))

C

double code(double B, double x) {
	return B * 0.16666666666666666;
}

Fortran

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

Java

public static double code(double B, double x) {
	return B * 0.16666666666666666;
}

Python

def code(B, x):
	return B * 0.16666666666666666

Julia

function code(B, x)
	return Float64(B * 0.16666666666666666)
end

MATLAB

function tmp = code(B, x)
	tmp = B * 0.16666666666666666;
end

Wolfram

code[B_, x_] := N[(B * 0.16666666666666666), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing

3. Taylor expanded in B around 0 64.9%

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

4. Taylor expanded in B around inf 3.0%

   \[\leadsto \color{blue}{0.16666666666666666 \cdot B} \]
5. Step-by-step derivation

   1. *-commutative 3.0%

      \[\leadsto \color{blue}{B \cdot 0.16666666666666666} \]

6. Simplified 3.0%

   \[\leadsto \color{blue}{B \cdot 0.16666666666666666} \]

7. Final simplification 3.0%

   \[\leadsto B \cdot 0.16666666666666666 \]
8. Add Preprocessing

Alternative 9: 27.4% 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. Add Preprocessing

3. Taylor expanded in B around 0 52.2%

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

   1. clear-num 52.2%

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

   2. inv-pow 52.2%

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

5. Applied egg-rr 52.2%

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

6. Taylor expanded in x around 0 26.4%

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

7. Final simplification 26.4%

   \[\leadsto \frac{1}{B} \]
8. Add Preprocessing

Reproduce

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