
(FPCore (B x) :precision binary64 (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))
double code(double B, double x) {
return -(x * (1.0 / tan(B))) + (1.0 / sin(B));
}
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
public static double code(double B, double x) {
return -(x * (1.0 / Math.tan(B))) + (1.0 / Math.sin(B));
}
def code(B, x): return -(x * (1.0 / math.tan(B))) + (1.0 / math.sin(B))
function code(B, x) return Float64(Float64(-Float64(x * Float64(1.0 / tan(B)))) + Float64(1.0 / sin(B))) end
function tmp = code(B, x) tmp = -(x * (1.0 / tan(B))) + (1.0 / sin(B)); end
code[B_, x_] := N[((-N[(x * N[(1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (B x) :precision binary64 (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))
double code(double B, double x) {
return -(x * (1.0 / tan(B))) + (1.0 / sin(B));
}
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
public static double code(double B, double x) {
return -(x * (1.0 / Math.tan(B))) + (1.0 / Math.sin(B));
}
def code(B, x): return -(x * (1.0 / math.tan(B))) + (1.0 / math.sin(B))
function code(B, x) return Float64(Float64(-Float64(x * Float64(1.0 / tan(B)))) + Float64(1.0 / sin(B))) end
function tmp = code(B, x) tmp = -(x * (1.0 / tan(B))) + (1.0 / sin(B)); end
code[B_, x_] := N[((-N[(x * N[(1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B}
\end{array}
(FPCore (B x) :precision binary64 (- (/ 1.0 (sin B)) (/ x (tan B))))
double code(double B, double x) {
return (1.0 / sin(B)) - (x / tan(B));
}
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
public static double code(double B, double x) {
return (1.0 / Math.sin(B)) - (x / Math.tan(B));
}
def code(B, x): return (1.0 / math.sin(B)) - (x / math.tan(B))
function code(B, x) return Float64(Float64(1.0 / sin(B)) - Float64(x / tan(B))) end
function tmp = code(B, x) tmp = (1.0 / sin(B)) - (x / tan(B)); end
code[B_, x_] := N[(N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sin B} - \frac{x}{\tan B}
\end{array}
Initial program 99.7%
distribute-lft-neg-in99.7%
+-commutative99.7%
*-commutative99.7%
remove-double-neg99.7%
distribute-frac-neg299.7%
tan-neg99.7%
cancel-sign-sub-inv99.7%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
(FPCore (B x) :precision binary64 (if (or (<= x -38.0) (not (<= x 100.0))) (- (sin B) (/ x (tan B))) (/ (- 1.0 x) (sin B))))
double code(double B, double x) {
double tmp;
if ((x <= -38.0) || !(x <= 100.0)) {
tmp = sin(B) - (x / tan(B));
} else {
tmp = (1.0 - x) / sin(B);
}
return tmp;
}
real(8) function code(b, x)
real(8), intent (in) :: b
real(8), intent (in) :: x
real(8) :: tmp
if ((x <= (-38.0d0)) .or. (.not. (x <= 100.0d0))) then
tmp = sin(b) - (x / tan(b))
else
tmp = (1.0d0 - x) / sin(b)
end if
code = tmp
end function
public static double code(double B, double x) {
double tmp;
if ((x <= -38.0) || !(x <= 100.0)) {
tmp = Math.sin(B) - (x / Math.tan(B));
} else {
tmp = (1.0 - x) / Math.sin(B);
}
return tmp;
}
def code(B, x): tmp = 0 if (x <= -38.0) or not (x <= 100.0): tmp = math.sin(B) - (x / math.tan(B)) else: tmp = (1.0 - x) / math.sin(B) return tmp
function code(B, x) tmp = 0.0 if ((x <= -38.0) || !(x <= 100.0)) tmp = Float64(sin(B) - Float64(x / tan(B))); else tmp = Float64(Float64(1.0 - x) / sin(B)); end return tmp end
function tmp_2 = code(B, x) tmp = 0.0; if ((x <= -38.0) || ~((x <= 100.0))) tmp = sin(B) - (x / tan(B)); else tmp = (1.0 - x) / sin(B); end tmp_2 = tmp; end
code[B_, x_] := If[Or[LessEqual[x, -38.0], N[Not[LessEqual[x, 100.0]], $MachinePrecision]], N[(N[Sin[B], $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - x), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -38 \lor \neg \left(x \leq 100\right):\\
\;\;\;\;\sin B - \frac{x}{\tan B}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 - x}{\sin B}\\
\end{array}
\end{array}
if x < -38 or 100 < x Initial program 99.6%
distribute-lft-neg-in99.6%
+-commutative99.6%
*-commutative99.6%
remove-double-neg99.6%
distribute-frac-neg299.6%
tan-neg99.6%
cancel-sign-sub-inv99.6%
associate-*l/99.7%
*-lft-identity99.7%
tan-neg99.7%
distribute-neg-frac299.7%
distribute-neg-frac99.7%
remove-double-neg99.7%
Simplified99.7%
add-exp-log48.2%
log-rec48.2%
Applied egg-rr48.2%
add-sqr-sqrt48.2%
sqrt-unprod48.2%
sqr-neg48.2%
sqrt-unprod0.0%
add-sqr-sqrt48.2%
add-exp-log99.1%
*-un-lft-identity99.1%
Applied egg-rr99.1%
*-lft-identity99.1%
Simplified99.1%
if -38 < x < 100Initial program 99.8%
distribute-lft-neg-in99.8%
+-commutative99.8%
*-commutative99.8%
remove-double-neg99.8%
distribute-frac-neg299.8%
tan-neg99.8%
cancel-sign-sub-inv99.8%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
tan-quot99.8%
associate-/r/99.8%
Applied egg-rr99.8%
Taylor expanded in B around inf 99.8%
div-sub99.8%
Simplified99.8%
Taylor expanded in B around 0 98.5%
Final simplification98.8%
(FPCore (B x) :precision binary64 (if (<= x -62.0) (- (sin B) (* x (/ 1.0 (tan B)))) (if (<= x 102000.0) (/ (- 1.0 x) (sin B)) (- (sin B) (/ x (tan B))))))
double code(double B, double x) {
double tmp;
if (x <= -62.0) {
tmp = sin(B) - (x * (1.0 / tan(B)));
} else if (x <= 102000.0) {
tmp = (1.0 - x) / sin(B);
} else {
tmp = sin(B) - (x / tan(B));
}
return tmp;
}
real(8) function code(b, x)
real(8), intent (in) :: b
real(8), intent (in) :: x
real(8) :: tmp
if (x <= (-62.0d0)) then
tmp = sin(b) - (x * (1.0d0 / tan(b)))
else if (x <= 102000.0d0) then
tmp = (1.0d0 - x) / sin(b)
else
tmp = sin(b) - (x / tan(b))
end if
code = tmp
end function
public static double code(double B, double x) {
double tmp;
if (x <= -62.0) {
tmp = Math.sin(B) - (x * (1.0 / Math.tan(B)));
} else if (x <= 102000.0) {
tmp = (1.0 - x) / Math.sin(B);
} else {
tmp = Math.sin(B) - (x / Math.tan(B));
}
return tmp;
}
def code(B, x): tmp = 0 if x <= -62.0: tmp = math.sin(B) - (x * (1.0 / math.tan(B))) elif x <= 102000.0: tmp = (1.0 - x) / math.sin(B) else: tmp = math.sin(B) - (x / math.tan(B)) return tmp
function code(B, x) tmp = 0.0 if (x <= -62.0) tmp = Float64(sin(B) - Float64(x * Float64(1.0 / tan(B)))); elseif (x <= 102000.0) tmp = Float64(Float64(1.0 - x) / sin(B)); else tmp = Float64(sin(B) - Float64(x / tan(B))); end return tmp end
function tmp_2 = code(B, x) tmp = 0.0; if (x <= -62.0) tmp = sin(B) - (x * (1.0 / tan(B))); elseif (x <= 102000.0) tmp = (1.0 - x) / sin(B); else tmp = sin(B) - (x / tan(B)); end tmp_2 = tmp; end
code[B_, x_] := If[LessEqual[x, -62.0], N[(N[Sin[B], $MachinePrecision] - N[(x * N[(1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 102000.0], N[(N[(1.0 - x), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision], N[(N[Sin[B], $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -62:\\
\;\;\;\;\sin B - x \cdot \frac{1}{\tan B}\\
\mathbf{elif}\;x \leq 102000:\\
\;\;\;\;\frac{1 - x}{\sin B}\\
\mathbf{else}:\\
\;\;\;\;\sin B - \frac{x}{\tan B}\\
\end{array}
\end{array}
if x < -62Initial program 99.7%
distribute-lft-neg-in99.7%
+-commutative99.7%
*-commutative99.7%
remove-double-neg99.7%
distribute-frac-neg299.7%
tan-neg99.7%
cancel-sign-sub-inv99.7%
associate-*l/99.6%
*-lft-identity99.6%
tan-neg99.6%
distribute-neg-frac299.6%
distribute-neg-frac99.6%
remove-double-neg99.6%
Simplified99.6%
add-exp-log39.8%
log-rec39.8%
Applied egg-rr39.8%
add-sqr-sqrt39.8%
sqrt-unprod39.8%
sqr-neg39.8%
sqrt-unprod0.0%
add-sqr-sqrt39.8%
add-exp-log98.2%
*-un-lft-identity98.2%
Applied egg-rr98.2%
*-lft-identity98.2%
Simplified98.2%
div-inv98.2%
*-commutative98.2%
Applied egg-rr98.2%
if -62 < x < 102000Initial program 99.8%
distribute-lft-neg-in99.8%
+-commutative99.8%
*-commutative99.8%
remove-double-neg99.8%
distribute-frac-neg299.8%
tan-neg99.8%
cancel-sign-sub-inv99.8%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
tan-quot99.8%
associate-/r/99.8%
Applied egg-rr99.8%
Taylor expanded in B around inf 99.8%
div-sub99.8%
Simplified99.8%
Taylor expanded in B around 0 98.5%
if 102000 < x Initial program 99.5%
distribute-lft-neg-in99.5%
+-commutative99.5%
*-commutative99.5%
remove-double-neg99.5%
distribute-frac-neg299.5%
tan-neg99.5%
cancel-sign-sub-inv99.5%
associate-*l/99.7%
*-lft-identity99.7%
tan-neg99.7%
distribute-neg-frac299.7%
distribute-neg-frac99.7%
remove-double-neg99.7%
Simplified99.7%
add-exp-log54.2%
log-rec54.2%
Applied egg-rr54.2%
add-sqr-sqrt54.2%
sqrt-unprod54.2%
sqr-neg54.2%
sqrt-unprod0.0%
add-sqr-sqrt54.2%
add-exp-log99.7%
*-un-lft-identity99.7%
Applied egg-rr99.7%
*-lft-identity99.7%
Simplified99.7%
Final simplification98.8%
(FPCore (B x) :precision binary64 (if (<= x -62.0) (* (- x) (/ (cos B) (sin B))) (if (<= x 105000.0) (/ (- 1.0 x) (sin B)) (- (sin B) (/ x (tan B))))))
double code(double B, double x) {
double tmp;
if (x <= -62.0) {
tmp = -x * (cos(B) / sin(B));
} else if (x <= 105000.0) {
tmp = (1.0 - x) / sin(B);
} else {
tmp = sin(B) - (x / tan(B));
}
return tmp;
}
real(8) function code(b, x)
real(8), intent (in) :: b
real(8), intent (in) :: x
real(8) :: tmp
if (x <= (-62.0d0)) then
tmp = -x * (cos(b) / sin(b))
else if (x <= 105000.0d0) then
tmp = (1.0d0 - x) / sin(b)
else
tmp = sin(b) - (x / tan(b))
end if
code = tmp
end function
public static double code(double B, double x) {
double tmp;
if (x <= -62.0) {
tmp = -x * (Math.cos(B) / Math.sin(B));
} else if (x <= 105000.0) {
tmp = (1.0 - x) / Math.sin(B);
} else {
tmp = Math.sin(B) - (x / Math.tan(B));
}
return tmp;
}
def code(B, x): tmp = 0 if x <= -62.0: tmp = -x * (math.cos(B) / math.sin(B)) elif x <= 105000.0: tmp = (1.0 - x) / math.sin(B) else: tmp = math.sin(B) - (x / math.tan(B)) return tmp
function code(B, x) tmp = 0.0 if (x <= -62.0) tmp = Float64(Float64(-x) * Float64(cos(B) / sin(B))); elseif (x <= 105000.0) tmp = Float64(Float64(1.0 - x) / sin(B)); else tmp = Float64(sin(B) - Float64(x / tan(B))); end return tmp end
function tmp_2 = code(B, x) tmp = 0.0; if (x <= -62.0) tmp = -x * (cos(B) / sin(B)); elseif (x <= 105000.0) tmp = (1.0 - x) / sin(B); else tmp = sin(B) - (x / tan(B)); end tmp_2 = tmp; end
code[B_, x_] := If[LessEqual[x, -62.0], N[((-x) * N[(N[Cos[B], $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 105000.0], N[(N[(1.0 - x), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision], N[(N[Sin[B], $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -62:\\
\;\;\;\;\left(-x\right) \cdot \frac{\cos B}{\sin B}\\
\mathbf{elif}\;x \leq 105000:\\
\;\;\;\;\frac{1 - x}{\sin B}\\
\mathbf{else}:\\
\;\;\;\;\sin B - \frac{x}{\tan B}\\
\end{array}
\end{array}
if x < -62Initial program 99.7%
distribute-lft-neg-in99.7%
+-commutative99.7%
*-commutative99.7%
remove-double-neg99.7%
distribute-frac-neg299.7%
tan-neg99.7%
cancel-sign-sub-inv99.7%
associate-*l/99.6%
*-lft-identity99.6%
tan-neg99.6%
distribute-neg-frac299.6%
distribute-neg-frac99.6%
remove-double-neg99.6%
Simplified99.6%
Taylor expanded in x around inf 98.0%
mul-1-neg98.0%
associate-/l*98.2%
distribute-lft-neg-in98.2%
Simplified98.2%
if -62 < x < 105000Initial program 99.8%
distribute-lft-neg-in99.8%
+-commutative99.8%
*-commutative99.8%
remove-double-neg99.8%
distribute-frac-neg299.8%
tan-neg99.8%
cancel-sign-sub-inv99.8%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
tan-quot99.8%
associate-/r/99.8%
Applied egg-rr99.8%
Taylor expanded in B around inf 99.8%
div-sub99.8%
Simplified99.8%
Taylor expanded in B around 0 98.5%
if 105000 < x Initial program 99.5%
distribute-lft-neg-in99.5%
+-commutative99.5%
*-commutative99.5%
remove-double-neg99.5%
distribute-frac-neg299.5%
tan-neg99.5%
cancel-sign-sub-inv99.5%
associate-*l/99.7%
*-lft-identity99.7%
tan-neg99.7%
distribute-neg-frac299.7%
distribute-neg-frac99.7%
remove-double-neg99.7%
Simplified99.7%
add-exp-log54.2%
log-rec54.2%
Applied egg-rr54.2%
add-sqr-sqrt54.2%
sqrt-unprod54.2%
sqr-neg54.2%
sqrt-unprod0.0%
add-sqr-sqrt54.2%
add-exp-log99.7%
*-un-lft-identity99.7%
Applied egg-rr99.7%
*-lft-identity99.7%
Simplified99.7%
(FPCore (B x)
:precision binary64
(if (<= B 0.0072)
(/
(- (+ 1.0 (* (* B B) (+ 0.16666666666666666 (* x 0.3333333333333333)))) x)
B)
(/ 1.0 (sin B))))
double code(double B, double x) {
double tmp;
if (B <= 0.0072) {
tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B;
} else {
tmp = 1.0 / sin(B);
}
return tmp;
}
real(8) function code(b, x)
real(8), intent (in) :: b
real(8), intent (in) :: x
real(8) :: tmp
if (b <= 0.0072d0) then
tmp = ((1.0d0 + ((b * b) * (0.16666666666666666d0 + (x * 0.3333333333333333d0)))) - x) / b
else
tmp = 1.0d0 / sin(b)
end if
code = tmp
end function
public static double code(double B, double x) {
double tmp;
if (B <= 0.0072) {
tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B;
} else {
tmp = 1.0 / Math.sin(B);
}
return tmp;
}
def code(B, x): tmp = 0 if B <= 0.0072: tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B else: tmp = 1.0 / math.sin(B) return tmp
function code(B, x) tmp = 0.0 if (B <= 0.0072) tmp = Float64(Float64(Float64(1.0 + Float64(Float64(B * B) * Float64(0.16666666666666666 + Float64(x * 0.3333333333333333)))) - x) / B); else tmp = Float64(1.0 / sin(B)); end return tmp end
function tmp_2 = code(B, x) tmp = 0.0; if (B <= 0.0072) tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B; else tmp = 1.0 / sin(B); end tmp_2 = tmp; end
code[B_, x_] := If[LessEqual[B, 0.0072], N[(N[(N[(1.0 + N[(N[(B * B), $MachinePrecision] * N[(0.16666666666666666 + N[(x * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision] / B), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;B \leq 0.0072:\\
\;\;\;\;\frac{\left(1 + \left(B \cdot B\right) \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right)\right) - x}{B}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sin B}\\
\end{array}
\end{array}
if B < 0.0071999999999999998Initial program 99.7%
distribute-lft-neg-in99.7%
+-commutative99.7%
*-commutative99.7%
remove-double-neg99.7%
distribute-frac-neg299.7%
tan-neg99.7%
cancel-sign-sub-inv99.7%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
Taylor expanded in B around 0 59.9%
unpow259.9%
Applied egg-rr59.9%
if 0.0071999999999999998 < B Initial program 99.6%
distribute-lft-neg-in99.6%
+-commutative99.6%
*-commutative99.6%
remove-double-neg99.6%
distribute-frac-neg299.6%
tan-neg99.6%
cancel-sign-sub-inv99.6%
associate-*l/99.6%
*-lft-identity99.6%
tan-neg99.6%
distribute-neg-frac299.6%
distribute-neg-frac99.6%
remove-double-neg99.6%
Simplified99.6%
Taylor expanded in x around 0 47.8%
Final simplification56.5%
(FPCore (B x)
:precision binary64
(if (<= B 1.55)
(/
(- (+ 1.0 (* (* B B) (+ 0.16666666666666666 (* x 0.3333333333333333)))) x)
B)
(sin B)))
double code(double B, double x) {
double tmp;
if (B <= 1.55) {
tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B;
} else {
tmp = sin(B);
}
return tmp;
}
real(8) function code(b, x)
real(8), intent (in) :: b
real(8), intent (in) :: x
real(8) :: tmp
if (b <= 1.55d0) then
tmp = ((1.0d0 + ((b * b) * (0.16666666666666666d0 + (x * 0.3333333333333333d0)))) - x) / b
else
tmp = sin(b)
end if
code = tmp
end function
public static double code(double B, double x) {
double tmp;
if (B <= 1.55) {
tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B;
} else {
tmp = Math.sin(B);
}
return tmp;
}
def code(B, x): tmp = 0 if B <= 1.55: tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B else: tmp = math.sin(B) return tmp
function code(B, x) tmp = 0.0 if (B <= 1.55) tmp = Float64(Float64(Float64(1.0 + Float64(Float64(B * B) * Float64(0.16666666666666666 + Float64(x * 0.3333333333333333)))) - x) / B); else tmp = sin(B); end return tmp end
function tmp_2 = code(B, x) tmp = 0.0; if (B <= 1.55) tmp = ((1.0 + ((B * B) * (0.16666666666666666 + (x * 0.3333333333333333)))) - x) / B; else tmp = sin(B); end tmp_2 = tmp; end
code[B_, x_] := If[LessEqual[B, 1.55], N[(N[(N[(1.0 + N[(N[(B * B), $MachinePrecision] * N[(0.16666666666666666 + N[(x * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision] / B), $MachinePrecision], N[Sin[B], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;B \leq 1.55:\\
\;\;\;\;\frac{\left(1 + \left(B \cdot B\right) \cdot \left(0.16666666666666666 + x \cdot 0.3333333333333333\right)\right) - x}{B}\\
\mathbf{else}:\\
\;\;\;\;\sin B\\
\end{array}
\end{array}
if B < 1.55000000000000004Initial program 99.7%
distribute-lft-neg-in99.7%
+-commutative99.7%
*-commutative99.7%
remove-double-neg99.7%
distribute-frac-neg299.7%
tan-neg99.7%
cancel-sign-sub-inv99.7%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
Taylor expanded in B around 0 60.0%
unpow260.0%
Applied egg-rr60.0%
if 1.55000000000000004 < B Initial program 99.6%
distribute-lft-neg-in99.6%
+-commutative99.6%
*-commutative99.6%
remove-double-neg99.6%
distribute-frac-neg299.6%
tan-neg99.6%
cancel-sign-sub-inv99.6%
associate-*l/99.6%
*-lft-identity99.6%
tan-neg99.6%
distribute-neg-frac299.6%
distribute-neg-frac99.6%
remove-double-neg99.6%
Simplified99.6%
add-exp-log43.5%
log-rec43.5%
Applied egg-rr43.5%
add-sqr-sqrt43.5%
sqrt-unprod43.5%
sqr-neg43.5%
sqrt-unprod0.0%
add-sqr-sqrt30.1%
add-exp-log61.5%
*-un-lft-identity61.5%
Applied egg-rr61.5%
*-lft-identity61.5%
Simplified61.5%
Taylor expanded in x around 0 11.1%
Final simplification46.4%
(FPCore (B x) :precision binary64 (/ (- 1.0 x) (sin B)))
double code(double B, double x) {
return (1.0 - x) / sin(B);
}
real(8) function code(b, x)
real(8), intent (in) :: b
real(8), intent (in) :: x
code = (1.0d0 - x) / sin(b)
end function
public static double code(double B, double x) {
return (1.0 - x) / Math.sin(B);
}
def code(B, x): return (1.0 - x) / math.sin(B)
function code(B, x) return Float64(Float64(1.0 - x) / sin(B)) end
function tmp = code(B, x) tmp = (1.0 - x) / sin(B); end
code[B_, x_] := N[(N[(1.0 - x), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1 - x}{\sin B}
\end{array}
Initial program 99.7%
distribute-lft-neg-in99.7%
+-commutative99.7%
*-commutative99.7%
remove-double-neg99.7%
distribute-frac-neg299.7%
tan-neg99.7%
cancel-sign-sub-inv99.7%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
tan-quot99.7%
associate-/r/99.7%
Applied egg-rr99.7%
Taylor expanded in B around inf 99.7%
div-sub99.7%
Simplified99.7%
Taylor expanded in B around 0 71.8%
(FPCore (B x) :precision binary64 (if (or (<= x -1.0) (not (<= x 2.3e+14))) (/ x (- B)) (/ 1.0 B)))
double code(double B, double x) {
double tmp;
if ((x <= -1.0) || !(x <= 2.3e+14)) {
tmp = x / -B;
} else {
tmp = 1.0 / B;
}
return tmp;
}
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 <= 2.3d+14))) then
tmp = x / -b
else
tmp = 1.0d0 / b
end if
code = tmp
end function
public static double code(double B, double x) {
double tmp;
if ((x <= -1.0) || !(x <= 2.3e+14)) {
tmp = x / -B;
} else {
tmp = 1.0 / B;
}
return tmp;
}
def code(B, x): tmp = 0 if (x <= -1.0) or not (x <= 2.3e+14): tmp = x / -B else: tmp = 1.0 / B return tmp
function code(B, x) tmp = 0.0 if ((x <= -1.0) || !(x <= 2.3e+14)) tmp = Float64(x / Float64(-B)); else tmp = Float64(1.0 / B); end return tmp end
function tmp_2 = code(B, x) tmp = 0.0; if ((x <= -1.0) || ~((x <= 2.3e+14))) tmp = x / -B; else tmp = 1.0 / B; end tmp_2 = tmp; end
code[B_, x_] := If[Or[LessEqual[x, -1.0], N[Not[LessEqual[x, 2.3e+14]], $MachinePrecision]], N[(x / (-B)), $MachinePrecision], N[(1.0 / B), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1 \lor \neg \left(x \leq 2.3 \cdot 10^{+14}\right):\\
\;\;\;\;\frac{x}{-B}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{B}\\
\end{array}
\end{array}
if x < -1 or 2.3e14 < x Initial program 99.5%
distribute-lft-neg-in99.5%
+-commutative99.5%
*-commutative99.5%
remove-double-neg99.5%
distribute-frac-neg299.5%
tan-neg99.5%
cancel-sign-sub-inv99.5%
associate-*l/99.7%
*-lft-identity99.7%
tan-neg99.7%
distribute-neg-frac299.7%
distribute-neg-frac99.7%
remove-double-neg99.7%
Simplified99.7%
Taylor expanded in B around 0 37.8%
Taylor expanded in x around inf 37.2%
associate-*r/37.2%
neg-mul-137.2%
Simplified37.2%
if -1 < x < 2.3e14Initial program 99.8%
distribute-lft-neg-in99.8%
+-commutative99.8%
*-commutative99.8%
remove-double-neg99.8%
distribute-frac-neg299.8%
tan-neg99.8%
cancel-sign-sub-inv99.8%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
Taylor expanded in B around 0 49.9%
Taylor expanded in x around 0 48.6%
Final simplification43.3%
(FPCore (B x) :precision binary64 (/ (- 1.0 x) B))
double code(double B, double x) {
return (1.0 - x) / B;
}
real(8) function code(b, x)
real(8), intent (in) :: b
real(8), intent (in) :: x
code = (1.0d0 - x) / b
end function
public static double code(double B, double x) {
return (1.0 - x) / B;
}
def code(B, x): return (1.0 - x) / B
function code(B, x) return Float64(Float64(1.0 - x) / B) end
function tmp = code(B, x) tmp = (1.0 - x) / B; end
code[B_, x_] := N[(N[(1.0 - x), $MachinePrecision] / B), $MachinePrecision]
\begin{array}{l}
\\
\frac{1 - x}{B}
\end{array}
Initial program 99.7%
distribute-lft-neg-in99.7%
+-commutative99.7%
*-commutative99.7%
remove-double-neg99.7%
distribute-frac-neg299.7%
tan-neg99.7%
cancel-sign-sub-inv99.7%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
Taylor expanded in B around 0 44.3%
(FPCore (B x) :precision binary64 (/ 1.0 B))
double code(double B, double x) {
return 1.0 / B;
}
real(8) function code(b, x)
real(8), intent (in) :: b
real(8), intent (in) :: x
code = 1.0d0 / b
end function
public static double code(double B, double x) {
return 1.0 / B;
}
def code(B, x): return 1.0 / B
function code(B, x) return Float64(1.0 / B) end
function tmp = code(B, x) tmp = 1.0 / B; end
code[B_, x_] := N[(1.0 / B), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{B}
\end{array}
Initial program 99.7%
distribute-lft-neg-in99.7%
+-commutative99.7%
*-commutative99.7%
remove-double-neg99.7%
distribute-frac-neg299.7%
tan-neg99.7%
cancel-sign-sub-inv99.7%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
Taylor expanded in B around 0 44.3%
Taylor expanded in x around 0 26.9%
(FPCore (B x) :precision binary64 (* B 0.16666666666666666))
double code(double B, double x) {
return B * 0.16666666666666666;
}
real(8) function code(b, x)
real(8), intent (in) :: b
real(8), intent (in) :: x
code = b * 0.16666666666666666d0
end function
public static double code(double B, double x) {
return B * 0.16666666666666666;
}
def code(B, x): return B * 0.16666666666666666
function code(B, x) return Float64(B * 0.16666666666666666) end
function tmp = code(B, x) tmp = B * 0.16666666666666666; end
code[B_, x_] := N[(B * 0.16666666666666666), $MachinePrecision]
\begin{array}{l}
\\
B \cdot 0.16666666666666666
\end{array}
Initial program 99.7%
distribute-lft-neg-in99.7%
+-commutative99.7%
*-commutative99.7%
remove-double-neg99.7%
distribute-frac-neg299.7%
tan-neg99.7%
cancel-sign-sub-inv99.7%
associate-*l/99.8%
*-lft-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
Taylor expanded in B around 0 44.1%
Taylor expanded in x around 0 44.1%
*-commutative44.1%
Simplified44.1%
Taylor expanded in B around inf 3.0%
*-commutative3.0%
Simplified3.0%
herbie shell --seed 2024131
(FPCore (B x)
:name "VandenBroeck and Keller, Equation (24)"
:precision binary64
(+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))