VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 8.6s

Alternatives: 8

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

   2. +-commutative 99.8%

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

   3. *-commutative 99.8%

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

   4. remove-double-neg 99.8%

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

   5. distribute-frac-neg2 99.8%

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

   6. tan-neg 99.8%

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

   7. cancel-sign-sub-inv 99.8%

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

   8. *-commutative 99.8%

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

   9. associate-*r/ 99.8%

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

   10. *-rgt-identity 99.8%

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

   11. tan-neg 99.8%

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

   12. distribute-neg-frac2 99.8%

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

   13. distribute-neg-frac 99.8%

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

   14. remove-double-neg 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. Add Preprocessing
5. Add Preprocessing

Alternative 2: 98.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -920000:\\ \;\;\;\;x \cdot \frac{-1}{\tan B}\\ \mathbf{elif}\;x \leq 510000000:\\ \;\;\;\;\frac{1 - x}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{-\tan B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (<= x -920000.0)
   (* x (/ -1.0 (tan B)))
   (if (<= x 510000000.0) (/ (- 1.0 x) (sin B)) (/ x (- (tan B))))))

C

double code(double B, double x) {
	double tmp;
	if (x <= -920000.0) {
		tmp = x * (-1.0 / tan(B));
	} else if (x <= 510000000.0) {
		tmp = (1.0 - x) / sin(B);
	} else {
		tmp = x / -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 <= (-920000.0d0)) then
        tmp = x * ((-1.0d0) / tan(b))
    else if (x <= 510000000.0d0) then
        tmp = (1.0d0 - x) / sin(b)
    else
        tmp = x / -tan(b)
    end if
    code = tmp
end function

Java

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

Python

def code(B, x):
	tmp = 0
	if x <= -920000.0:
		tmp = x * (-1.0 / math.tan(B))
	elif x <= 510000000.0:
		tmp = (1.0 - x) / math.sin(B)
	else:
		tmp = x / -math.tan(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if (x <= -920000.0)
		tmp = Float64(x * Float64(-1.0 / tan(B)));
	elseif (x <= 510000000.0)
		tmp = Float64(Float64(1.0 - x) / sin(B));
	else
		tmp = Float64(x / Float64(-tan(B)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if (x <= -920000.0)
		tmp = x * (-1.0 / tan(B));
	elseif (x <= 510000000.0)
		tmp = (1.0 - x) / sin(B);
	else
		tmp = x / -tan(B);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -9.2e5

   1. Initial program 99.8%

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

      1. +-commutative 99.8%

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

      2. div-inv 99.8%

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

      3. sub-neg 99.8%

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

      4. clear-num 99.7%

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

      5. frac-sub 83.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 83.0%

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

      7. *-commutative 83.0%

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

      8. *-un-lft-identity 83.0%

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

   4. Applied egg-rr 83.0%

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

      1. associate-/r* 99.7%

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

      2. associate-/r/ 99.8%

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

      3. div-sub 99.8%

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

      4. *-inverses 99.8%

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

   6. Simplified 99.8%

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

   7. Taylor expanded in x around inf 99.1%

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

   if -9.2e5 < x < 5.1e8

   1. Initial program 99.8%

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

      1. +-commutative 99.8%

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

      2. div-inv 99.8%

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

      3. sub-neg 99.8%

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

      4. clear-num 99.8%

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

      5. frac-sub 91.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 91.0%

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

      7. *-commutative 91.0%

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

      8. *-un-lft-identity 91.0%

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

   4. Applied egg-rr 91.0%

      \[\leadsto \color{blue}{\frac{\frac{\tan B}{x} - \sin B}{\sin B \cdot \frac{\tan B}{x}}} \]
   5. 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/ 74.6%

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

      3. div-sub 74.6%

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

      4. *-inverses 74.6%

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

   6. Simplified 74.6%

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

   7. Taylor expanded in B around inf 99.5%

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

   8. Taylor expanded in B around 0 99.2%

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

      1. sub-neg 99.2%

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

      2. metadata-eval 99.2%

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

      3. distribute-rgt-in 99.2%

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

      4. lft-mult-inverse 99.4%

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

      5. mul-1-neg 99.4%

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

      6. sub-neg 99.4%

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

   10. Simplified 99.4%

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

   if 5.1e8 < 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 x around inf 99.7%

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

      1. mul-1-neg 99.7%

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

      2. associate-/l* 99.7%

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

      3. distribute-rgt-neg-in 99.7%

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

      4. distribute-neg-frac2 99.7%

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

   5. Simplified 99.7%

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

      1. distribute-frac-neg2 99.7%

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

      2. clear-num 99.6%

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

      3. tan-quot 99.7%

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

      4. distribute-rgt-neg-in 99.7%

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

      5. distribute-lft-neg-in 99.7%

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

      6. un-div-inv 99.8%

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

   7. Applied egg-rr 99.8%

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

4. Final simplification 99.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -920000:\\ \;\;\;\;x \cdot \frac{-1}{\tan B}\\ \mathbf{elif}\;x \leq 510000000:\\ \;\;\;\;\frac{1 - x}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{-\tan B}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.65 \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.65) (not (<= x 1.0))) (/ x (- (tan B))) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -1.65) || !(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.65d0)) .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.65) || !(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.65) 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.65) || !(x <= 1.0))
		tmp = Float64(x / Float64(-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.65) || ~((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.65], 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.6499999999999999 or 1 < 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 x around inf 98.0%

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

      1. mul-1-neg 98.0%

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

      2. associate-/l* 98.0%

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

      3. distribute-rgt-neg-in 98.0%

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

      4. distribute-neg-frac2 98.0%

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

   5. Simplified 98.0%

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

      1. distribute-frac-neg2 98.0%

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

      2. clear-num 97.9%

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

      3. tan-quot 98.0%

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

      4. distribute-rgt-neg-in 98.0%

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

      5. distribute-lft-neg-in 98.0%

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

      6. un-div-inv 98.0%

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

   7. Applied egg-rr 98.0%

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

   if -1.6499999999999999 < x < 1

   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 97.8%

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

4. Final simplification 97.9%

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

Alternative 4: 97.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.65:\\ \;\;\;\;x \cdot \frac{-1}{\tan B}\\ \mathbf{elif}\;x \leq 1.1:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{-\tan B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (<= x -1.65)
   (* x (/ -1.0 (tan B)))
   (if (<= x 1.1) (/ 1.0 (sin B)) (/ x (- (tan B))))))

C

double code(double B, double x) {
	double tmp;
	if (x <= -1.65) {
		tmp = x * (-1.0 / tan(B));
	} else if (x <= 1.1) {
		tmp = 1.0 / sin(B);
	} else {
		tmp = x / -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.65d0)) then
        tmp = x * ((-1.0d0) / tan(b))
    else if (x <= 1.1d0) then
        tmp = 1.0d0 / sin(b)
    else
        tmp = x / -tan(b)
    end if
    code = tmp
end function

Java

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

Python

def code(B, x):
	tmp = 0
	if x <= -1.65:
		tmp = x * (-1.0 / math.tan(B))
	elif x <= 1.1:
		tmp = 1.0 / math.sin(B)
	else:
		tmp = x / -math.tan(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if (x <= -1.65)
		tmp = Float64(x * Float64(-1.0 / tan(B)));
	elseif (x <= 1.1)
		tmp = Float64(1.0 / sin(B));
	else
		tmp = Float64(x / Float64(-tan(B)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if (x <= -1.65)
		tmp = x * (-1.0 / tan(B));
	elseif (x <= 1.1)
		tmp = 1.0 / sin(B);
	else
		tmp = x / -tan(B);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -1.6499999999999999

   1. Initial program 99.8%

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

      1. +-commutative 99.8%

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

      2. div-inv 99.8%

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

      3. sub-neg 99.8%

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

      4. clear-num 99.7%

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

      5. frac-sub 82.1%

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

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

      7. *-commutative 82.1%

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

      8. *-un-lft-identity 82.1%

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

   4. Applied egg-rr 82.1%

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

      1. associate-/r* 99.7%

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

      2. associate-/r/ 99.8%

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

      3. div-sub 99.8%

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

      4. *-inverses 99.8%

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

   6. Simplified 99.8%

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

   7. Taylor expanded in x around inf 97.0%

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

   if -1.6499999999999999 < x < 1.1000000000000001

   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 97.8%

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

   if 1.1000000000000001 < 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 x around inf 99.1%

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

      1. mul-1-neg 99.1%

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

      2. associate-/l* 99.2%

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

      3. distribute-rgt-neg-in 99.2%

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

      4. distribute-neg-frac2 99.2%

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

   5. Simplified 99.2%

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

      1. distribute-frac-neg2 99.2%

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

      2. clear-num 99.0%

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

      3. tan-quot 99.1%

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

      4. distribute-rgt-neg-in 99.1%

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

      5. distribute-lft-neg-in 99.1%

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

      6. un-div-inv 99.2%

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

   7. Applied egg-rr 99.2%

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

4. Final simplification 97.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.65:\\ \;\;\;\;x \cdot \frac{-1}{\tan B}\\ \mathbf{elif}\;x \leq 1.1:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{-\tan B}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 62.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq 3.1 \cdot 10^{-5}:\\ \;\;\;\;\frac{1 - x}{B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (<= B 3.1e-5) (/ (- 1.0 x) B) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	double tmp;
	if (B <= 3.1e-5) {
		tmp = (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 <= 3.1d-5) then
        tmp = (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 <= 3.1e-5) {
		tmp = (1.0 - x) / B;
	} else {
		tmp = 1.0 / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if B <= 3.1e-5:
		tmp = (1.0 - x) / B
	else:
		tmp = 1.0 / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if (B <= 3.1e-5)
		tmp = 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 <= 3.1e-5)
		tmp = (1.0 - x) / B;
	else
		tmp = 1.0 / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[LessEqual[B, 3.1e-5], N[(N[(1.0 - x), $MachinePrecision] / B), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if B < 3.10000000000000014e-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 72.0%

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

   if 3.10000000000000014e-5 < B

   1. Initial program 99.6%

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

   3. Taylor expanded in x around 0 53.6%

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

Alternative 6: 49.7% accurate, 14.9× 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(x / Float64(-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. Add Preprocessing

   3. Taylor expanded in B around 0 57.0%

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

   4. Taylor expanded in x around inf 55.7%

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

      1. neg-mul-1 55.7%

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

   6. Simplified 55.7%

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

   if -1 < x < 1

   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 49.3%

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

   4. Taylor expanded in x around 0 47.9%

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

4. Final simplification 51.9%

   \[\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} \]
5. Add Preprocessing

Alternative 7: 50.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.8%

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

3. Taylor expanded in B around 0 53.3%

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

Alternative 8: 26.2% 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.8%

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

3. Taylor expanded in B around 0 53.3%

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

4. Taylor expanded in x around 0 25.1%

   \[\leadsto \color{blue}{\frac{1}{B}} \]
5. Add Preprocessing

Reproduce

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