VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 9.7s

Alternatives: 11

Speedup: 1.1×

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. Add Preprocessing

4. Applied egg-rr 99.9%

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

Alternative 2: 98.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\sin B}\\ t_1 := t\_0 + x \cdot \frac{-1}{\tan B}\\ t_2 := \frac{1 - x}{\tan B}\\ \mathbf{if}\;t\_1 \leq -50000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 20000000:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (let* ((t_0 (/ 1.0 (sin B)))
        (t_1 (+ t_0 (* x (/ -1.0 (tan B)))))
        (t_2 (/ (- 1.0 x) (tan B))))
   (if (<= t_1 -50000.0) t_2 (if (<= t_1 20000000.0) t_0 t_2))))

C

double code(double B, double x) {
	double t_0 = 1.0 / sin(B);
	double t_1 = t_0 + (x * (-1.0 / tan(B)));
	double t_2 = (1.0 - x) / tan(B);
	double tmp;
	if (t_1 <= -50000.0) {
		tmp = t_2;
	} else if (t_1 <= 20000000.0) {
		tmp = t_0;
	} else {
		tmp = t_2;
	}
	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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_0 = 1.0d0 / sin(b)
    t_1 = t_0 + (x * ((-1.0d0) / tan(b)))
    t_2 = (1.0d0 - x) / tan(b)
    if (t_1 <= (-50000.0d0)) then
        tmp = t_2
    else if (t_1 <= 20000000.0d0) then
        tmp = t_0
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double t_0 = 1.0 / Math.sin(B);
	double t_1 = t_0 + (x * (-1.0 / Math.tan(B)));
	double t_2 = (1.0 - x) / Math.tan(B);
	double tmp;
	if (t_1 <= -50000.0) {
		tmp = t_2;
	} else if (t_1 <= 20000000.0) {
		tmp = t_0;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(B, x):
	t_0 = 1.0 / math.sin(B)
	t_1 = t_0 + (x * (-1.0 / math.tan(B)))
	t_2 = (1.0 - x) / math.tan(B)
	tmp = 0
	if t_1 <= -50000.0:
		tmp = t_2
	elif t_1 <= 20000000.0:
		tmp = t_0
	else:
		tmp = t_2
	return tmp

Julia

function code(B, x)
	t_0 = Float64(1.0 / sin(B))
	t_1 = Float64(t_0 + Float64(x * Float64(-1.0 / tan(B))))
	t_2 = Float64(Float64(1.0 - x) / tan(B))
	tmp = 0.0
	if (t_1 <= -50000.0)
		tmp = t_2;
	elseif (t_1 <= 20000000.0)
		tmp = t_0;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	t_0 = 1.0 / sin(B);
	t_1 = t_0 + (x * (-1.0 / tan(B)));
	t_2 = (1.0 - x) / tan(B);
	tmp = 0.0;
	if (t_1 <= -50000.0)
		tmp = t_2;
	elseif (t_1 <= 20000000.0)
		tmp = t_0;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := Block[{t$95$0 = N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 + N[(x * N[(-1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(1.0 - x), $MachinePrecision] / N[Tan[B], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -50000.0], t$95$2, If[LessEqual[t$95$1, 20000000.0], t$95$0, t$95$2]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (neg.f64 (*.f64 x (/.f64 #s(literal 1 binary64) (tan.f64 B)))) (/.f64 #s(literal 1 binary64) (sin.f64 B))) < -5e4 or 2e7 < (+.f64 (neg.f64 (*.f64 x (/.f64 #s(literal 1 binary64) (tan.f64 B)))) (/.f64 #s(literal 1 binary64) (sin.f64 B)))

   1. Initial program 99.7%

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

   4. Applied egg-rr 99.9%

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

      1. lift-sin.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. +-rgt-identity N/A

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

      4. flip-+ N/A

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

      5. --rgt-identity N/A

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

      6. lift-tan.f64 N/A

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

      7. --rgt-identity N/A

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

      8. flip-+ N/A

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

      9. +-rgt-identity N/A

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

      10. lift-/.f64 N/A

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

      11. frac-sub N/A

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

      12. /-rgt-identity N/A

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

      13. associate-/r* N/A

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

      14. lower-/.f64 N/A

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

   6. Applied egg-rr 99.8%

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

   7. Taylor expanded in B around 0

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

      1. lower--.f64 99.6

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

   9. Simplified 99.6%

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

   if -5e4 < (+.f64 (neg.f64 (*.f64 x (/.f64 #s(literal 1 binary64) (tan.f64 B)))) (/.f64 #s(literal 1 binary64) (sin.f64 B))) < 2e7

   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

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

      1. lower-/.f64 N/A

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

      2. lower-sin.f64 95.9

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

   5. Simplified 95.9%

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

4. Final simplification 98.6%

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

Reproduce

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