
(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 9 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%
*-commutative99.7%
associate-*r/99.8%
*-rgt-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
(FPCore (B x)
:precision binary64
(let* ((t_0 (/ x (tan B))))
(if (<= x -3.3e-16)
(* t_0 (+ (/ 1.0 x) -1.0))
(if (<= x 1.0) (/ 1.0 (sin B)) (- (sin B) t_0)))))
double code(double B, double x) {
double t_0 = x / tan(B);
double tmp;
if (x <= -3.3e-16) {
tmp = t_0 * ((1.0 / x) + -1.0);
} else if (x <= 1.0) {
tmp = 1.0 / sin(B);
} else {
tmp = sin(B) - t_0;
}
return tmp;
}
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 <= (-3.3d-16)) then
tmp = t_0 * ((1.0d0 / x) + (-1.0d0))
else if (x <= 1.0d0) then
tmp = 1.0d0 / sin(b)
else
tmp = sin(b) - t_0
end if
code = tmp
end function
public static double code(double B, double x) {
double t_0 = x / Math.tan(B);
double tmp;
if (x <= -3.3e-16) {
tmp = t_0 * ((1.0 / x) + -1.0);
} else if (x <= 1.0) {
tmp = 1.0 / Math.sin(B);
} else {
tmp = Math.sin(B) - t_0;
}
return tmp;
}
def code(B, x): t_0 = x / math.tan(B) tmp = 0 if x <= -3.3e-16: tmp = t_0 * ((1.0 / x) + -1.0) elif x <= 1.0: tmp = 1.0 / math.sin(B) else: tmp = math.sin(B) - t_0 return tmp
function code(B, x) t_0 = Float64(x / tan(B)) tmp = 0.0 if (x <= -3.3e-16) tmp = Float64(t_0 * Float64(Float64(1.0 / x) + -1.0)); elseif (x <= 1.0) tmp = Float64(1.0 / sin(B)); else tmp = Float64(sin(B) - t_0); end return tmp end
function tmp_2 = code(B, x) t_0 = x / tan(B); tmp = 0.0; if (x <= -3.3e-16) tmp = t_0 * ((1.0 / x) + -1.0); elseif (x <= 1.0) tmp = 1.0 / sin(B); else tmp = sin(B) - t_0; end tmp_2 = tmp; end
code[B_, x_] := Block[{t$95$0 = N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.3e-16], N[(t$95$0 * N[(N[(1.0 / x), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.0], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision], N[(N[Sin[B], $MachinePrecision] - t$95$0), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{x}{\tan B}\\
\mathbf{if}\;x \leq -3.3 \cdot 10^{-16}:\\
\;\;\;\;t\_0 \cdot \left(\frac{1}{x} + -1\right)\\
\mathbf{elif}\;x \leq 1:\\
\;\;\;\;\frac{1}{\sin B}\\
\mathbf{else}:\\
\;\;\;\;\sin B - t\_0\\
\end{array}
\end{array}
if x < -3.29999999999999988e-16Initial 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%
*-commutative99.6%
associate-*r/99.8%
*-rgt-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.7%
Applied egg-rr99.7%
associate-/r/99.8%
tan-quot99.8%
clear-num99.6%
Applied egg-rr99.6%
frac-sub82.0%
div-inv79.6%
*-un-lft-identity79.6%
*-rgt-identity79.6%
metadata-eval79.6%
frac-times79.5%
associate-*l/79.7%
*-un-lft-identity79.7%
clear-num79.8%
Applied egg-rr79.8%
associate-*r/99.8%
associate-*l/99.8%
div-sub99.9%
sub-neg99.9%
associate-/l/99.8%
*-commutative99.8%
*-inverses99.8%
metadata-eval99.8%
Simplified99.8%
Taylor expanded in B around 0 99.9%
if -3.29999999999999988e-16 < x < 1Initial program 99.7%
Taylor expanded in x around 0 98.8%
if 1 < 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%
*-commutative99.6%
associate-*r/99.8%
*-rgt-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
tan-quot99.6%
associate-/r/99.7%
Applied egg-rr99.7%
associate-/r/99.6%
tan-quot99.8%
sub-neg99.8%
add-exp-log45.5%
neg-log45.5%
add-sqr-sqrt45.5%
sqrt-unprod45.5%
sqr-neg45.5%
sqrt-unprod0.0%
add-sqr-sqrt42.6%
add-exp-log95.4%
distribute-neg-frac295.4%
Applied egg-rr95.4%
distribute-frac-neg295.4%
sub-neg95.4%
Simplified95.4%
Final simplification98.3%
(FPCore (B x) :precision binary64 (if (or (<= x -3.3e-16) (not (<= x 1.02))) (* (/ x (tan B)) (+ (/ 1.0 x) -1.0)) (/ 1.0 (sin B))))
double code(double B, double x) {
double tmp;
if ((x <= -3.3e-16) || !(x <= 1.02)) {
tmp = (x / tan(B)) * ((1.0 / x) + -1.0);
} 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 ((x <= (-3.3d-16)) .or. (.not. (x <= 1.02d0))) then
tmp = (x / tan(b)) * ((1.0d0 / x) + (-1.0d0))
else
tmp = 1.0d0 / sin(b)
end if
code = tmp
end function
public static double code(double B, double x) {
double tmp;
if ((x <= -3.3e-16) || !(x <= 1.02)) {
tmp = (x / Math.tan(B)) * ((1.0 / x) + -1.0);
} else {
tmp = 1.0 / Math.sin(B);
}
return tmp;
}
def code(B, x): tmp = 0 if (x <= -3.3e-16) or not (x <= 1.02): tmp = (x / math.tan(B)) * ((1.0 / x) + -1.0) else: tmp = 1.0 / math.sin(B) return tmp
function code(B, x) tmp = 0.0 if ((x <= -3.3e-16) || !(x <= 1.02)) tmp = Float64(Float64(x / tan(B)) * Float64(Float64(1.0 / x) + -1.0)); else tmp = Float64(1.0 / sin(B)); end return tmp end
function tmp_2 = code(B, x) tmp = 0.0; if ((x <= -3.3e-16) || ~((x <= 1.02))) tmp = (x / tan(B)) * ((1.0 / x) + -1.0); else tmp = 1.0 / sin(B); end tmp_2 = tmp; end
code[B_, x_] := If[Or[LessEqual[x, -3.3e-16], N[Not[LessEqual[x, 1.02]], $MachinePrecision]], N[(N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / x), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -3.3 \cdot 10^{-16} \lor \neg \left(x \leq 1.02\right):\\
\;\;\;\;\frac{x}{\tan B} \cdot \left(\frac{1}{x} + -1\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sin B}\\
\end{array}
\end{array}
if x < -3.29999999999999988e-16 or 1.02 < x 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%
*-commutative99.7%
associate-*r/99.8%
*-rgt-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%
associate-/r/99.7%
tan-quot99.8%
clear-num99.6%
Applied egg-rr99.6%
frac-sub79.4%
div-inv77.5%
*-un-lft-identity77.5%
*-rgt-identity77.5%
metadata-eval77.5%
frac-times77.4%
associate-*l/77.5%
*-un-lft-identity77.5%
clear-num77.6%
Applied egg-rr77.6%
associate-*r/99.8%
associate-*l/99.8%
div-sub99.8%
sub-neg99.8%
associate-/l/99.8%
*-commutative99.8%
*-inverses99.8%
metadata-eval99.8%
Simplified99.8%
Taylor expanded in B around 0 98.3%
if -3.29999999999999988e-16 < x < 1.02Initial program 99.7%
Taylor expanded in x around 0 98.2%
Final simplification98.2%
(FPCore (B x) :precision binary64 (if (or (<= x -1.45e-15) (not (<= x 0.0022))) (- (/ 1.0 B) (/ x (tan B))) (/ 1.0 (sin B))))
double code(double B, double x) {
double tmp;
if ((x <= -1.45e-15) || !(x <= 0.0022)) {
tmp = (1.0 / B) - (x / tan(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 ((x <= (-1.45d-15)) .or. (.not. (x <= 0.0022d0))) then
tmp = (1.0d0 / b) - (x / tan(b))
else
tmp = 1.0d0 / sin(b)
end if
code = tmp
end function
public static double code(double B, double x) {
double tmp;
if ((x <= -1.45e-15) || !(x <= 0.0022)) {
tmp = (1.0 / B) - (x / Math.tan(B));
} else {
tmp = 1.0 / Math.sin(B);
}
return tmp;
}
def code(B, x): tmp = 0 if (x <= -1.45e-15) or not (x <= 0.0022): tmp = (1.0 / B) - (x / math.tan(B)) else: tmp = 1.0 / math.sin(B) return tmp
function code(B, x) tmp = 0.0 if ((x <= -1.45e-15) || !(x <= 0.0022)) tmp = Float64(Float64(1.0 / B) - Float64(x / tan(B))); else tmp = Float64(1.0 / sin(B)); end return tmp end
function tmp_2 = code(B, x) tmp = 0.0; if ((x <= -1.45e-15) || ~((x <= 0.0022))) tmp = (1.0 / B) - (x / tan(B)); else tmp = 1.0 / sin(B); end tmp_2 = tmp; end
code[B_, x_] := If[Or[LessEqual[x, -1.45e-15], N[Not[LessEqual[x, 0.0022]], $MachinePrecision]], N[(N[(1.0 / B), $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.45 \cdot 10^{-15} \lor \neg \left(x \leq 0.0022\right):\\
\;\;\;\;\frac{1}{B} - \frac{x}{\tan B}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sin B}\\
\end{array}
\end{array}
if x < -1.45000000000000009e-15 or 0.00220000000000000013 < x 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%
*-commutative99.7%
associate-*r/99.8%
*-rgt-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 97.6%
if -1.45000000000000009e-15 < x < 0.00220000000000000013Initial program 99.7%
Taylor expanded in x around 0 98.8%
Final simplification98.2%
(FPCore (B x) :precision binary64 (if (or (<= x -1.3) (not (<= x 1.0))) (- 1.0 (/ x (tan B))) (/ 1.0 (sin B))))
double code(double B, double x) {
double tmp;
if ((x <= -1.3) || !(x <= 1.0)) {
tmp = 1.0 - (x / tan(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 ((x <= (-1.3d0)) .or. (.not. (x <= 1.0d0))) then
tmp = 1.0d0 - (x / tan(b))
else
tmp = 1.0d0 / sin(b)
end if
code = tmp
end function
public static double code(double B, double x) {
double tmp;
if ((x <= -1.3) || !(x <= 1.0)) {
tmp = 1.0 - (x / Math.tan(B));
} else {
tmp = 1.0 / Math.sin(B);
}
return tmp;
}
def code(B, x): tmp = 0 if (x <= -1.3) or not (x <= 1.0): tmp = 1.0 - (x / math.tan(B)) else: tmp = 1.0 / math.sin(B) return tmp
function code(B, x) tmp = 0.0 if ((x <= -1.3) || !(x <= 1.0)) tmp = Float64(1.0 - Float64(x / tan(B))); else tmp = Float64(1.0 / sin(B)); end return tmp end
function tmp_2 = code(B, x) tmp = 0.0; if ((x <= -1.3) || ~((x <= 1.0))) tmp = 1.0 - (x / tan(B)); else tmp = 1.0 / sin(B); end tmp_2 = tmp; end
code[B_, x_] := If[Or[LessEqual[x, -1.3], N[Not[LessEqual[x, 1.0]], $MachinePrecision]], N[(1.0 - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.3 \lor \neg \left(x \leq 1\right):\\
\;\;\;\;1 - \frac{x}{\tan B}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sin B}\\
\end{array}
\end{array}
if x < -1.30000000000000004 or 1 < x 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%
*-commutative99.7%
associate-*r/99.8%
*-rgt-identity99.8%
tan-neg99.8%
distribute-neg-frac299.8%
distribute-neg-frac99.8%
remove-double-neg99.8%
Simplified99.8%
add-exp-log38.6%
log-rec38.6%
Applied egg-rr38.6%
exp-neg38.6%
add-exp-log99.8%
add-sqr-sqrt38.6%
associate-/r*38.6%
metadata-eval38.6%
sqrt-div38.6%
add-exp-log38.6%
neg-log38.6%
add-sqr-sqrt38.6%
sqrt-unprod38.6%
sqr-neg38.6%
sqrt-unprod0.0%
add-sqr-sqrt36.6%
add-exp-log36.6%
Applied egg-rr36.6%
*-inverses95.8%
Simplified95.8%
if -1.30000000000000004 < x < 1Initial program 99.7%
Taylor expanded in x around 0 98.5%
Final simplification97.3%
(FPCore (B x) :precision binary64 (if (<= B 2.8e-5) (/ (- 1.0 x) B) (/ 1.0 (sin B))))
double code(double B, double x) {
double tmp;
if (B <= 2.8e-5) {
tmp = (1.0 - 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 <= 2.8d-5) then
tmp = (1.0d0 - 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 <= 2.8e-5) {
tmp = (1.0 - x) / B;
} else {
tmp = 1.0 / Math.sin(B);
}
return tmp;
}
def code(B, x): tmp = 0 if B <= 2.8e-5: tmp = (1.0 - x) / B else: tmp = 1.0 / math.sin(B) return tmp
function code(B, x) tmp = 0.0 if (B <= 2.8e-5) tmp = Float64(Float64(1.0 - x) / B); else tmp = Float64(1.0 / sin(B)); end return tmp end
function tmp_2 = code(B, x) tmp = 0.0; if (B <= 2.8e-5) tmp = (1.0 - x) / B; else tmp = 1.0 / sin(B); end tmp_2 = tmp; end
code[B_, x_] := If[LessEqual[B, 2.8e-5], N[(N[(1.0 - x), $MachinePrecision] / B), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;B \leq 2.8 \cdot 10^{-5}:\\
\;\;\;\;\frac{1 - x}{B}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sin B}\\
\end{array}
\end{array}
if B < 2.79999999999999996e-5Initial program 99.8%
Taylor expanded in B around 0 70.2%
if 2.79999999999999996e-5 < B Initial program 99.3%
Taylor expanded in x around 0 63.6%
(FPCore (B x) :precision binary64 (if (or (<= x -1.0) (not (<= x 1.02))) (/ x (- B)) (/ 1.0 B)))
double code(double B, double x) {
double tmp;
if ((x <= -1.0) || !(x <= 1.02)) {
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 <= 1.02d0))) 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 <= 1.02)) {
tmp = x / -B;
} else {
tmp = 1.0 / B;
}
return tmp;
}
def code(B, x): tmp = 0 if (x <= -1.0) or not (x <= 1.02): tmp = x / -B else: tmp = 1.0 / B return tmp
function code(B, x) tmp = 0.0 if ((x <= -1.0) || !(x <= 1.02)) 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 <= 1.02))) 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, 1.02]], $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 1.02\right):\\
\;\;\;\;\frac{x}{-B}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{B}\\
\end{array}
\end{array}
if x < -1 or 1.02 < x Initial program 99.7%
Taylor expanded in B around 0 58.2%
Taylor expanded in x around inf 56.3%
neg-mul-156.3%
Simplified56.3%
if -1 < x < 1.02Initial program 99.7%
Taylor expanded in B around 0 51.6%
Taylor expanded in x around 0 51.2%
Final simplification53.6%
(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%
Taylor expanded in B around 0 54.6%
(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%
Taylor expanded in B around 0 54.6%
Taylor expanded in x around 0 29.1%
herbie shell --seed 2024092
(FPCore (B x)
:name "VandenBroeck and Keller, Equation (24)"
:precision binary64
(+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))