VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 6.7s

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

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

   4. remove-double-neg 99.7%

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

   5. distribute-frac-neg2 99.7%

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

   6. tan-neg 99.7%

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

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

   8. *-commutative 99.7%

      \[\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.8% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -1150000.0], N[Not[LessEqual[x, 1.05]], $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[(1.0 - x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.15e6 or 1.05000000000000004 < 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. *-commutative 99.7%

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

      4. remove-double-neg 99.7%

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

      5. distribute-frac-neg2 99.7%

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

      6. tan-neg 99.7%

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

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

      8. *-commutative 99.7%

         \[\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. Taylor expanded in B around 0 98.1%

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

   if -1.15e6 < x < 1.05000000000000004

   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. tan-quot 99.8%

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

      2. associate-/r/ 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in x around 0 99.8%

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

      1. +-commutative 99.8%

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

      2. mul-1-neg 99.8%

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

      3. sub-neg 99.8%

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

      4. *-rgt-identity 99.8%

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

      5. *-lft-identity 99.8%

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

      6. associate-*l/ 99.8%

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

      7. distribute-lft-out-- 99.8%

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

   7. Simplified 99.8%

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

   8. Taylor expanded in B around 0 99.1%

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

4. Final simplification 98.6%

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

Alternative 3: 75.9% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -0.94999999999999996 or 4200 < x

   1. Initial program 99.7%

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

      1. tan-quot 99.6%

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

      2. associate-/r/ 99.6%

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

   4. Applied egg-rr 99.6%

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

   5. Taylor expanded in x around inf 97.6%

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

      1. mul-1-neg 97.6%

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

      2. associate-*r/ 97.6%

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

      3. distribute-lft-neg-in 97.6%

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

      4. *-commutative 97.6%

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

   7. Simplified 97.6%

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

   8. Taylor expanded in B around 0 51.7%

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

   if -0.94999999999999996 < x < 4200

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

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

4. Final simplification 75.4%

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

Alternative 4: 63.2% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 0.0189999999999999995

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

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

   4. Taylor expanded in x around 0 61.9%

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

   if 0.0189999999999999995 < 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 60.7%

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

4. Final simplification 61.6%

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

Alternative 5: 76.8% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

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

   1. tan-quot 99.7%

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

   2. associate-/r/ 99.7%

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

4. Applied egg-rr 99.7%

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

5. Taylor expanded in x around 0 99.7%

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

   1. +-commutative 99.7%

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

   2. mul-1-neg 99.7%

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

   3. sub-neg 99.7%

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

   4. *-rgt-identity 99.7%

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

   5. *-lft-identity 99.7%

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

   6. associate-*l/ 99.7%

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

   7. distribute-lft-out-- 99.7%

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

7. Simplified 99.7%

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

8. Taylor expanded in B around 0 75.8%

   \[\leadsto \frac{1}{\sin B} \cdot \left(1 - \color{blue}{x}\right) \]
9. Add Preprocessing

Alternative 6: 52.1% accurate, 12.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[B_, x_] := N[(N[(B * 0.16666666666666666), $MachinePrecision] + N[(N[(1.0 / B), $MachinePrecision] + N[(x * N[(N[(B * 0.3333333333333333), $MachinePrecision] + N[(-1.0 / B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 50.0%

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

4. Taylor expanded in x around 0 50.1%

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

5. Final simplification 50.1%

   \[\leadsto B \cdot 0.16666666666666666 + \left(\frac{1}{B} + x \cdot \left(B \cdot 0.3333333333333333 + \frac{-1}{B}\right)\right) \]
6. Add Preprocessing

Alternative 7: 51.9% 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 49.4%

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

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

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

3. Taylor expanded in x around 0 51.4%

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

4. Taylor expanded in B around 0 27.3%

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

Alternative 9: 3.2% 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 50.0%

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

4. Taylor expanded in B around inf 3.0%

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

5. Taylor expanded in x around 0 2.9%

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

6. Final simplification 2.9%

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

Reproduce

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