VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 7.3s

Alternatives: 11

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.7% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -3.3e5 or 1.11999999999999998e-4 < x

   1. Initial program 99.6%

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

      1. +-commutative 99.6%

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

      2. 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. frac-sub 94.8%

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

      5. associate-/r* 99.7%

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

      6. *-un-lft-identity 99.7%

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

      7. *-commutative 99.7%

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

   3. Applied egg-rr 99.7%

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

   4. Taylor expanded in B around 0 99.0%

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

   if -3.3e5 < x < 1.11999999999999998e-4

   1. Initial program 99.8%

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

   2. Taylor expanded in B around 0 99.2%

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

4. Final simplification 99.1%

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

Alternative 3: 97.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{-x}{\tan B}\\ \mathbf{if}\;x \leq -1.45:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 7.8 \cdot 10^{-5}:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{elif}\;x \leq 57000000:\\ \;\;\;\;\frac{1 - x}{B}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (let* ((t_0 (/ (- x) (tan B))))
   (if (<= x -1.45)
     t_0
     (if (<= x 7.8e-5)
       (/ 1.0 (sin B))
       (if (<= x 57000000.0) (/ (- 1.0 x) B) t_0)))))

C

double code(double B, double x) {
	double t_0 = -x / tan(B);
	double tmp;
	if (x <= -1.45) {
		tmp = t_0;
	} else if (x <= 7.8e-5) {
		tmp = 1.0 / sin(B);
	} else if (x <= 57000000.0) {
		tmp = (1.0 - x) / B;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(b, x)
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = -x / tan(b)
    if (x <= (-1.45d0)) then
        tmp = t_0
    else if (x <= 7.8d-5) then
        tmp = 1.0d0 / sin(b)
    else if (x <= 57000000.0d0) then
        tmp = (1.0d0 - x) / b
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double t_0 = -x / Math.tan(B);
	double tmp;
	if (x <= -1.45) {
		tmp = t_0;
	} else if (x <= 7.8e-5) {
		tmp = 1.0 / Math.sin(B);
	} else if (x <= 57000000.0) {
		tmp = (1.0 - x) / B;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(B, x):
	t_0 = -x / math.tan(B)
	tmp = 0
	if x <= -1.45:
		tmp = t_0
	elif x <= 7.8e-5:
		tmp = 1.0 / math.sin(B)
	elif x <= 57000000.0:
		tmp = (1.0 - x) / B
	else:
		tmp = t_0
	return tmp

Julia

function code(B, x)
	t_0 = Float64(Float64(-x) / tan(B))
	tmp = 0.0
	if (x <= -1.45)
		tmp = t_0;
	elseif (x <= 7.8e-5)
		tmp = Float64(1.0 / sin(B));
	elseif (x <= 57000000.0)
		tmp = Float64(Float64(1.0 - x) / B);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	t_0 = -x / tan(B);
	tmp = 0.0;
	if (x <= -1.45)
		tmp = t_0;
	elseif (x <= 7.8e-5)
		tmp = 1.0 / sin(B);
	elseif (x <= 57000000.0)
		tmp = (1.0 - x) / B;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := Block[{t$95$0 = N[((-x) / N[Tan[B], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.45], t$95$0, If[LessEqual[x, 7.8e-5], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 57000000.0], N[(N[(1.0 - x), $MachinePrecision] / B), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.44999999999999996 or 5.7e7 < x

   1. Initial program 99.6%

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

      1. +-commutative 99.6%

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

      2. 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. frac-sub 95.8%

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

      5. associate-/r* 99.7%

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

      6. *-un-lft-identity 99.7%

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

      7. *-commutative 99.7%

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

   3. Applied egg-rr 99.7%

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

   4. Taylor expanded in x around inf 98.5%

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

      1. neg-mul-1 98.5%

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

   6. Simplified 98.5%

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

   if -1.44999999999999996 < x < 7.7999999999999999e-5

   1. Initial program 99.8%

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

   2. Taylor expanded in x around 0 98.4%

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

   if 7.7999999999999999e-5 < x < 5.7e7

   1. Initial program 99.2%

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

   2. Taylor expanded in B around 0 100.0%

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

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.45:\\ \;\;\;\;\frac{-x}{\tan B}\\ \mathbf{elif}\;x \leq 7.8 \cdot 10^{-5}:\\ \;\;\;\;\frac{1}{\sin B}\\ \mathbf{elif}\;x \leq 57000000:\\ \;\;\;\;\frac{1 - x}{B}\\ \mathbf{else}:\\ \;\;\;\;\frac{-x}{\tan B}\\ \end{array} \]

Alternative 4: 98.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{-7} \lor \neg \left(x \leq 3.8 \cdot 10^{-5}\right):\\ \;\;\;\;\frac{1 - x}{\tan B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -8.5e-7) (not (<= x 3.8e-5)))
   (/ (- 1.0 x) (tan B))
   (/ 1.0 (sin B))))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -8.50000000000000014e-7 or 3.8000000000000002e-5 < x

   1. Initial program 99.6%

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

      1. +-commutative 99.6%

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

      2. 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. frac-sub 94.1%

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

      5. associate-/r* 99.7%

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

      6. *-un-lft-identity 99.7%

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

      7. *-commutative 99.7%

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

   3. Applied egg-rr 99.7%

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

   4. Taylor expanded in B around 0 99.0%

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

   if -8.50000000000000014e-7 < x < 3.8000000000000002e-5

   1. Initial program 99.8%

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

   2. Taylor expanded in x around 0 98.9%

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

4. Final simplification 98.9%

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

Alternative 5: 62.8% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 12

   1. Initial program 99.8%

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

   2. Taylor expanded in B around 0 68.2%

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

      1. associate--l+ 68.2%

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

      2. *-commutative 68.2%

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

      3. div-sub 68.2%

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

   4. Simplified 68.2%

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

   if 12 < B

   1. Initial program 99.5%

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

   2. Taylor expanded in x around 0 47.9%

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

4. Final simplification 62.8%

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

Alternative 6: 51.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. Taylor expanded in B around 0 50.8%

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

   1. associate--l+ 50.8%

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

   2. *-commutative 50.8%

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

   3. div-sub 50.8%

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

4. Simplified 50.8%

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

5. Taylor expanded in x around inf 50.9%

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

6. Final simplification 50.9%

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

Alternative 7: 51.3% 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. Taylor expanded in B around 0 72.8%

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

3. Taylor expanded in B around 0 50.8%

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

   1. associate--l+ 50.8%

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

   2. *-commutative 50.8%

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

   3. div-sub 50.8%

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

5. Simplified 50.8%

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

6. Final simplification 50.8%

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

Alternative 8: 50.1% accurate, 25.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 99.6%

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

   2. Taylor expanded in B around 0 50.7%

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

   3. Taylor expanded in x around inf 49.0%

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

      1. associate-*r/ 49.0%

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

      2. neg-mul-1 49.0%

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

   5. Simplified 49.0%

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

   if -1 < x < 1

   1. Initial program 99.8%

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

   2. Taylor expanded in B around 0 49.9%

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

   3. Taylor expanded in x around 0 47.3%

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

4. Final simplification 48.2%

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

Alternative 9: 51.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. Taylor expanded in B around 0 50.4%

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

3. Final simplification 50.4%

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

Alternative 10: 3.1% accurate, 70.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

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

2. Taylor expanded in B around 0 65.2%

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

3. Taylor expanded in B around inf 3.2%

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

   1. *-commutative 3.2%

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

5. Simplified 3.2%

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

6. Final simplification 3.2%

   \[\leadsto B \cdot 0.16666666666666666 \]

Alternative 11: 26.5% accurate, 70.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

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

2. Taylor expanded in B around 0 50.4%

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

3. Taylor expanded in x around 0 23.0%

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

4. Final simplification 23.0%

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

Reproduce

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