VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 13.5s

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. 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. *-commutative 99.7%

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

   5. *-commutative 99.7%

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

   6. associate-*r/ 99.8%

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

   7. *-rgt-identity 99.8%

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

3. Simplified 99.8%

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

4. Final simplification 99.8%

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

Alternative 2: 98.1% accurate, 1.9× speedup

Math

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

C

double code(double B, double x) {
	double tmp;
	if ((x <= -3.3e-15) || !(x <= 2.4e-21)) {
		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 <= (-3.3d-15)) .or. (.not. (x <= 2.4d-21))) 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 <= -3.3e-15) || !(x <= 2.4e-21)) {
		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 <= -3.3e-15) or not (x <= 2.4e-21):
		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 <= -3.3e-15) || !(x <= 2.4e-21))
		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 <= -3.3e-15) || ~((x <= 2.4e-21)))
		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, -3.3e-15], N[Not[LessEqual[x, 2.4e-21]], $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 < -3.3e-15 or 2.3999999999999999e-21 < 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} \]

      2. +-commutative 99.6%

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

      3. cancel-sign-sub-inv 99.6%

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

      4. *-commutative 99.6%

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

      5. *-commutative 99.6%

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

      6. associate-*r/ 99.7%

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

      7. *-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 \frac{1}{\color{blue}{B}} - \frac{x}{\tan B} \]

   if -3.3e-15 < x < 2.3999999999999999e-21

   1. Initial program 99.9%

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

      1. distribute-lft-neg-in 99.9%

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

      2. +-commutative 99.9%

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

      3. distribute-lft-neg-in 99.9%

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

      4. distribute-rgt-neg-in 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in x around 0 99.9%

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

4. Final simplification 98.8%

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

Alternative 3: 97.5% accurate, 1.9× speedup

Math

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

FPCore

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

C

double code(double B, double x) {
	double tmp;
	if ((x <= -1.56) || !(x <= 1.05)) {
		tmp = -1.0 / (tan(B) / x);
	} 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.56d0)) .or. (.not. (x <= 1.05d0))) then
        tmp = (-1.0d0) / (tan(b) / x)
    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.56) || !(x <= 1.05)) {
		tmp = -1.0 / (Math.tan(B) / x);
	} else {
		tmp = 1.0 / Math.sin(B);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.5600000000000001 or 1.05000000000000004 < 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} \]

      2. +-commutative 99.6%

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

      3. distribute-lft-neg-in 99.6%

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

      4. distribute-rgt-neg-in 99.6%

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

   3. Simplified 99.6%

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

      1. distribute-rgt-neg-out 99.6%

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

      2. div-inv 99.7%

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

      3. sub-neg 99.7%

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

      4. clear-num 99.4%

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

      5. frac-sub 89.9%

         \[\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 89.9%

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

      7. *-commutative 89.9%

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

      8. *-un-lft-identity 89.9%

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

   5. Applied egg-rr 89.9%

      \[\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.4%

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

      2. div-sub 99.4%

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

      3. *-inverses 99.4%

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

   7. Simplified 99.4%

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

   8. Taylor expanded in x around inf 97.4%

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

   if -1.5600000000000001 < x < 1.05000000000000004

   1. Initial program 99.9%

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

      1. distribute-lft-neg-in 99.9%

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

      2. +-commutative 99.9%

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

      3. distribute-lft-neg-in 99.9%

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

      4. distribute-rgt-neg-in 99.9%

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

   3. Simplified 99.9%

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

   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.1%

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

Alternative 4: 74.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.3 \cdot 10^{-15}:\\ \;\;\;\;\left(\frac{1}{B} + B \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right)\right) - \frac{x}{B}\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{-21}:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - x}{B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (<= x -3.3e-15)
   (-
    (+ (/ 1.0 B) (* B (+ 0.16666666666666666 (* x 0.3333333333333333))))
    (/ x B))
   (if (<= x 2.4e-21) (/ 1.0 (sin B)) (/ (- 1.0 x) B))))

C

double code(double B, double x) {
	double tmp;
	if (x <= -3.3e-15) {
		tmp = ((1.0 / B) + (B * (0.16666666666666666 + (x * 0.3333333333333333)))) - (x / B);
	} else if (x <= 2.4e-21) {
		tmp = 1.0 / sin(B);
	} else {
		tmp = (1.0 - 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 <= (-3.3d-15)) then
        tmp = ((1.0d0 / b) + (b * (0.16666666666666666d0 + (x * 0.3333333333333333d0)))) - (x / b)
    else if (x <= 2.4d-21) then
        tmp = 1.0d0 / sin(b)
    else
        tmp = (1.0d0 - x) / b
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if (x <= -3.3e-15) {
		tmp = ((1.0 / B) + (B * (0.16666666666666666 + (x * 0.3333333333333333)))) - (x / B);
	} else if (x <= 2.4e-21) {
		tmp = 1.0 / Math.sin(B);
	} else {
		tmp = (1.0 - x) / B;
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if x <= -3.3e-15:
		tmp = ((1.0 / B) + (B * (0.16666666666666666 + (x * 0.3333333333333333)))) - (x / B)
	elif x <= 2.4e-21:
		tmp = 1.0 / math.sin(B)
	else:
		tmp = (1.0 - x) / B
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if (x <= -3.3e-15)
		tmp = Float64(Float64(Float64(1.0 / B) + Float64(B * Float64(0.16666666666666666 + Float64(x * 0.3333333333333333)))) - Float64(x / B));
	elseif (x <= 2.4e-21)
		tmp = Float64(1.0 / sin(B));
	else
		tmp = Float64(Float64(1.0 - x) / B);
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if (x <= -3.3e-15)
		tmp = ((1.0 / B) + (B * (0.16666666666666666 + (x * 0.3333333333333333)))) - (x / B);
	elseif (x <= 2.4e-21)
		tmp = 1.0 / sin(B);
	else
		tmp = (1.0 - x) / B;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -3.3e-15

   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. *-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. associate-*r/ 99.8%

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

      7. *-rgt-identity 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in B around 0 42.7%

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

   if -3.3e-15 < x < 2.3999999999999999e-21

   1. Initial program 99.9%

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

      1. distribute-lft-neg-in 99.9%

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

      2. +-commutative 99.9%

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

      3. distribute-lft-neg-in 99.9%

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

      4. distribute-rgt-neg-in 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in x around 0 99.9%

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

   if 2.3999999999999999e-21 < x

   1. Initial program 99.5%

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

      1. distribute-lft-neg-in 99.5%

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

      2. +-commutative 99.5%

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

      3. distribute-lft-neg-in 99.5%

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

      4. distribute-rgt-neg-in 99.5%

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

   3. Simplified 99.5%

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

   4. Taylor expanded in B around 0 47.2%

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

      1. neg-mul-1 47.2%

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

      2. sub-neg 47.2%

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

   6. Simplified 47.2%

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

4. Final simplification 70.9%

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

Alternative 5: 52.5% 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} \]

   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. *-commutative 99.7%

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

   5. *-commutative 99.7%

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

   6. associate-*r/ 99.8%

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

   7. *-rgt-identity 99.8%

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

3. Simplified 99.8%

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

4. Taylor expanded in B around 0 76.6%

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

5. Taylor expanded in B around 0 48.8%

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

   1. unpow-1 48.8%

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

   2. associate--l+ 48.8%

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

   3. *-commutative 48.8%

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

   4. unpow-1 48.8%

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

   5. div-sub 48.8%

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

7. Simplified 48.8%

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

8. Final simplification 48.8%

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

Alternative 6: 52.4% 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} \]

   2. +-commutative 99.7%

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

   3. distribute-lft-neg-in 99.7%

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

   4. distribute-rgt-neg-in 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in B around 0 48.6%

   \[\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.6%

      \[\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.6%

      \[\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.6%

      \[\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.6%

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

   5. *-commutative 48.6%

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

   6. *-commutative 48.6%

      \[\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.6%

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

6. Simplified 48.6%

   \[\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.1%

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

   1. *-commutative 48.1%

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

9. Simplified 48.1%

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

10. Final simplification 48.1%

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

Alternative 7: 50.6% accurate, 25.8× speedup

Math

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

FPCore

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

C

double code(double B, double x) {
	double tmp;
	if ((x <= -185000000.0) || !(x <= 4500000000000.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 <= (-185000000.0d0)) .or. (.not. (x <= 4500000000000.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 <= -185000000.0) || !(x <= 4500000000000.0)) {
		tmp = -x / B;
	} else {
		tmp = 1.0 / B;
	}
	return tmp;
}

Python

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

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -185000000.0) || !(x <= 4500000000000.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 <= -185000000.0) || ~((x <= 4500000000000.0)))
		tmp = -x / B;
	else
		tmp = 1.0 / B;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.85e8 or 4.5e12 < 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} \]

      2. +-commutative 99.6%

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

      3. distribute-lft-neg-in 99.6%

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

      4. distribute-rgt-neg-in 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in B around 0 43.3%

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

      1. neg-mul-1 43.3%

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

      2. sub-neg 43.3%

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

   6. Simplified 43.3%

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

   7. Taylor expanded in x around inf 43.3%

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

      1. neg-mul-1 43.3%

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

      2. distribute-neg-frac 43.3%

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

   9. Simplified 43.3%

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

   if -1.85e8 < x < 4.5e12

   1. Initial program 99.9%

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

      1. distribute-lft-neg-in 99.9%

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

      2. +-commutative 99.9%

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

      3. distribute-lft-neg-in 99.9%

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

      4. distribute-rgt-neg-in 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in B around 0 52.6%

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

      1. neg-mul-1 52.6%

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

      2. sub-neg 52.6%

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

   6. Simplified 52.6%

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

   7. Taylor expanded in x around 0 51.5%

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

4. Final simplification 47.5%

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

Alternative 8: 52.1% accurate, 30.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[B_, x_] := N[(N[(1.0 / B), $MachinePrecision] - N[(x / B), $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. *-commutative 99.7%

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

   5. *-commutative 99.7%

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

   6. associate-*r/ 99.8%

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

   7. *-rgt-identity 99.8%

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

3. Simplified 99.8%

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

4. Taylor expanded in B around 0 76.6%

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

5. Taylor expanded in B around 0 48.1%

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

6. Final simplification 48.1%

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

Alternative 9: 52.2% 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} \]

   2. +-commutative 99.7%

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

   3. distribute-lft-neg-in 99.7%

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

   4. distribute-rgt-neg-in 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in B around 0 48.1%

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

   1. neg-mul-1 48.1%

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

   2. sub-neg 48.1%

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

6. Simplified 48.1%

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

7. Final simplification 48.1%

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

Alternative 10: 26.7% 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} \]

   2. +-commutative 99.7%

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

   3. distribute-lft-neg-in 99.7%

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

   4. distribute-rgt-neg-in 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in B around 0 48.1%

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

   1. neg-mul-1 48.1%

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

   2. sub-neg 48.1%

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

6. Simplified 48.1%

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

7. Taylor expanded in x around 0 27.6%

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

8. Final simplification 27.6%

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

Reproduce

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