
(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 10 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%
Applied rewrites99.8%
(FPCore (B x) :precision binary64 (/ (fma (cos B) (- x) 1.0) (sin B)))
double code(double B, double x) {
return fma(cos(B), -x, 1.0) / sin(B);
}
function code(B, x) return Float64(fma(cos(B), Float64(-x), 1.0) / sin(B)) end
code[B_, x_] := N[(N[(N[Cos[B], $MachinePrecision] * (-x) + 1.0), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\mathsf{fma}\left(\cos B, -x, 1\right)}{\sin B}
\end{array}
Initial program 99.7%
Applied rewrites99.8%
Taylor expanded in B around inf
associate-/l*N/A
rgt-mult-inverseN/A
associate-*r/N/A
associate-/r*N/A
distribute-lft-out--N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
sub-negN/A
Applied rewrites99.7%
lift-sin.f64N/A
frac-2negN/A
metadata-evalN/A
lift-neg.f64N/A
lift-cos.f64N/A
lift-fma.f64N/A
metadata-evalN/A
lift-neg.f64N/A
frac-2negN/A
associate-*l/N/A
lower-/.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-neg.f6499.8
Applied rewrites99.8%
(FPCore (B x)
:precision binary64
(let* ((t_0 (- (/ 1.0 B) (/ x (tan B)))))
(if (<= x -0.00035)
t_0
(if (<= x 720000000000.0) (/ (- 1.0 x) (sin B)) t_0))))
double code(double B, double x) {
double t_0 = (1.0 / B) - (x / tan(B));
double tmp;
if (x <= -0.00035) {
tmp = t_0;
} else if (x <= 720000000000.0) {
tmp = (1.0 - x) / sin(B);
} else {
tmp = 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 = (1.0d0 / b) - (x / tan(b))
if (x <= (-0.00035d0)) then
tmp = t_0
else if (x <= 720000000000.0d0) then
tmp = (1.0d0 - x) / sin(b)
else
tmp = t_0
end if
code = tmp
end function
public static double code(double B, double x) {
double t_0 = (1.0 / B) - (x / Math.tan(B));
double tmp;
if (x <= -0.00035) {
tmp = t_0;
} else if (x <= 720000000000.0) {
tmp = (1.0 - x) / Math.sin(B);
} else {
tmp = t_0;
}
return tmp;
}
def code(B, x): t_0 = (1.0 / B) - (x / math.tan(B)) tmp = 0 if x <= -0.00035: tmp = t_0 elif x <= 720000000000.0: tmp = (1.0 - x) / math.sin(B) else: tmp = t_0 return tmp
function code(B, x) t_0 = Float64(Float64(1.0 / B) - Float64(x / tan(B))) tmp = 0.0 if (x <= -0.00035) tmp = t_0; elseif (x <= 720000000000.0) tmp = Float64(Float64(1.0 - x) / sin(B)); else tmp = t_0; end return tmp end
function tmp_2 = code(B, x) t_0 = (1.0 / B) - (x / tan(B)); tmp = 0.0; if (x <= -0.00035) tmp = t_0; elseif (x <= 720000000000.0) tmp = (1.0 - x) / sin(B); else tmp = t_0; end tmp_2 = tmp; end
code[B_, x_] := Block[{t$95$0 = N[(N[(1.0 / B), $MachinePrecision] - N[(x / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -0.00035], t$95$0, If[LessEqual[x, 720000000000.0], N[(N[(1.0 - x), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{1}{B} - \frac{x}{\tan B}\\
\mathbf{if}\;x \leq -0.00035:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;x \leq 720000000000:\\
\;\;\;\;\frac{1 - x}{\sin B}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if x < -3.49999999999999996e-4 or 7.2e11 < x Initial program 99.6%
Applied rewrites99.9%
Taylor expanded in B around 0
lower-/.f6499.7
Applied rewrites99.7%
if -3.49999999999999996e-4 < x < 7.2e11Initial program 99.8%
Applied rewrites99.8%
Taylor expanded in B around inf
associate-/l*N/A
rgt-mult-inverseN/A
associate-*r/N/A
associate-/r*N/A
distribute-lft-out--N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
sub-negN/A
Applied rewrites99.8%
lift-sin.f64N/A
frac-2negN/A
metadata-evalN/A
lift-neg.f64N/A
lift-cos.f64N/A
lift-fma.f64N/A
metadata-evalN/A
lift-neg.f64N/A
frac-2negN/A
associate-*l/N/A
lower-/.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-neg.f6499.8
Applied rewrites99.8%
Taylor expanded in B around 0
mul-1-negN/A
sub-negN/A
lower--.f6499.8
Applied rewrites99.8%
(FPCore (B x)
:precision binary64
(if (<= B 0.84)
(/
(fma
(* B B)
(fma
x
0.3333333333333333
(fma
(* B B)
(fma
B
(* B (fma x 0.0021164021164021165 0.00205026455026455))
(fma x 0.022222222222222223 0.019444444444444445))
0.16666666666666666))
(- 1.0 x))
B)
(/ 1.0 (sin B))))
double code(double B, double x) {
double tmp;
if (B <= 0.84) {
tmp = fma((B * B), fma(x, 0.3333333333333333, fma((B * B), fma(B, (B * fma(x, 0.0021164021164021165, 0.00205026455026455)), fma(x, 0.022222222222222223, 0.019444444444444445)), 0.16666666666666666)), (1.0 - x)) / B;
} else {
tmp = 1.0 / sin(B);
}
return tmp;
}
function code(B, x) tmp = 0.0 if (B <= 0.84) tmp = Float64(fma(Float64(B * B), fma(x, 0.3333333333333333, fma(Float64(B * B), fma(B, Float64(B * fma(x, 0.0021164021164021165, 0.00205026455026455)), fma(x, 0.022222222222222223, 0.019444444444444445)), 0.16666666666666666)), Float64(1.0 - x)) / B); else tmp = Float64(1.0 / sin(B)); end return tmp end
code[B_, x_] := If[LessEqual[B, 0.84], N[(N[(N[(B * B), $MachinePrecision] * N[(x * 0.3333333333333333 + N[(N[(B * B), $MachinePrecision] * N[(B * N[(B * N[(x * 0.0021164021164021165 + 0.00205026455026455), $MachinePrecision]), $MachinePrecision] + N[(x * 0.022222222222222223 + 0.019444444444444445), $MachinePrecision]), $MachinePrecision] + 0.16666666666666666), $MachinePrecision]), $MachinePrecision] + N[(1.0 - x), $MachinePrecision]), $MachinePrecision] / B), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;B \leq 0.84:\\
\;\;\;\;\frac{\mathsf{fma}\left(B \cdot B, \mathsf{fma}\left(x, 0.3333333333333333, \mathsf{fma}\left(B \cdot B, \mathsf{fma}\left(B, B \cdot \mathsf{fma}\left(x, 0.0021164021164021165, 0.00205026455026455\right), \mathsf{fma}\left(x, 0.022222222222222223, 0.019444444444444445\right)\right), 0.16666666666666666\right)\right), 1 - x\right)}{B}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sin B}\\
\end{array}
\end{array}
if B < 0.839999999999999969Initial program 99.8%
Taylor expanded in B around 0
Applied rewrites67.9%
if 0.839999999999999969 < B Initial program 99.4%
Taylor expanded in x around 0
lower-/.f64N/A
lower-sin.f6447.4
Applied rewrites47.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%
Applied rewrites99.8%
Taylor expanded in B around inf
associate-/l*N/A
rgt-mult-inverseN/A
associate-*r/N/A
associate-/r*N/A
distribute-lft-out--N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
sub-negN/A
Applied rewrites99.7%
lift-sin.f64N/A
frac-2negN/A
metadata-evalN/A
lift-neg.f64N/A
lift-cos.f64N/A
lift-fma.f64N/A
metadata-evalN/A
lift-neg.f64N/A
frac-2negN/A
associate-*l/N/A
lower-/.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
lower-fma.f64N/A
lower-neg.f6499.8
Applied rewrites99.8%
Taylor expanded in B around 0
mul-1-negN/A
sub-negN/A
lower--.f6477.1
Applied rewrites77.1%
(FPCore (B x) :precision binary64 (/ (/ (- B (* B x)) B) B))
double code(double B, double x) {
return ((B - (B * x)) / B) / B;
}
real(8) function code(b, x)
real(8), intent (in) :: b
real(8), intent (in) :: x
code = ((b - (b * x)) / b) / b
end function
public static double code(double B, double x) {
return ((B - (B * x)) / B) / B;
}
def code(B, x): return ((B - (B * x)) / B) / B
function code(B, x) return Float64(Float64(Float64(B - Float64(B * x)) / B) / B) end
function tmp = code(B, x) tmp = ((B - (B * x)) / B) / B; end
code[B_, x_] := N[(N[(N[(B - N[(B * x), $MachinePrecision]), $MachinePrecision] / B), $MachinePrecision] / B), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{B - B \cdot x}{B}}{B}
\end{array}
Initial program 99.7%
Taylor expanded in B around 0
lower-/.f64N/A
lower--.f6451.6
Applied rewrites51.6%
div-subN/A
frac-subN/A
lower-/.f64N/A
lower--.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6440.6
Applied rewrites40.6%
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6451.7
lift-*.f64N/A
*-lft-identity51.7
Applied rewrites51.7%
(FPCore (B x) :precision binary64 (let* ((t_0 (- (/ x B)))) (if (<= x -1.0) t_0 (if (<= x 1.0) (/ 1.0 B) t_0))))
double code(double B, double x) {
double t_0 = -(x / B);
double tmp;
if (x <= -1.0) {
tmp = t_0;
} else if (x <= 1.0) {
tmp = 1.0 / B;
} else {
tmp = 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 / b)
if (x <= (-1.0d0)) then
tmp = t_0
else if (x <= 1.0d0) then
tmp = 1.0d0 / b
else
tmp = t_0
end if
code = tmp
end function
public static double code(double B, double x) {
double t_0 = -(x / B);
double tmp;
if (x <= -1.0) {
tmp = t_0;
} else if (x <= 1.0) {
tmp = 1.0 / B;
} else {
tmp = t_0;
}
return tmp;
}
def code(B, x): t_0 = -(x / B) tmp = 0 if x <= -1.0: tmp = t_0 elif x <= 1.0: tmp = 1.0 / B else: tmp = t_0 return tmp
function code(B, x) t_0 = Float64(-Float64(x / B)) tmp = 0.0 if (x <= -1.0) tmp = t_0; elseif (x <= 1.0) tmp = Float64(1.0 / B); else tmp = t_0; end return tmp end
function tmp_2 = code(B, x) t_0 = -(x / B); tmp = 0.0; if (x <= -1.0) tmp = t_0; elseif (x <= 1.0) tmp = 1.0 / B; else tmp = t_0; end tmp_2 = tmp; end
code[B_, x_] := Block[{t$95$0 = (-N[(x / B), $MachinePrecision])}, If[LessEqual[x, -1.0], t$95$0, If[LessEqual[x, 1.0], N[(1.0 / B), $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := -\frac{x}{B}\\
\mathbf{if}\;x \leq -1:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;x \leq 1:\\
\;\;\;\;\frac{1}{B}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if x < -1 or 1 < x Initial program 99.6%
Taylor expanded in B around 0
lower-/.f64N/A
lower--.f6455.2
Applied rewrites55.2%
Taylor expanded in x around inf
mul-1-negN/A
lower-neg.f6454.0
Applied rewrites54.0%
if -1 < x < 1Initial program 99.8%
Taylor expanded in x around 0
lower-/.f64N/A
lower-sin.f6498.8
Applied rewrites98.8%
Taylor expanded in B around 0
lower-/.f6446.4
Applied rewrites46.4%
Final simplification50.5%
(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
lower-/.f64N/A
lower--.f6451.6
Applied rewrites51.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 x around 0
lower-/.f64N/A
lower-sin.f6447.1
Applied rewrites47.1%
Taylor expanded in B around 0
lower-/.f6422.9
Applied rewrites22.9%
(FPCore (B x) :precision binary64 (* B (fma x 0.3333333333333333 0.16666666666666666)))
double code(double B, double x) {
return B * fma(x, 0.3333333333333333, 0.16666666666666666);
}
function code(B, x) return Float64(B * fma(x, 0.3333333333333333, 0.16666666666666666)) end
code[B_, x_] := N[(B * N[(x * 0.3333333333333333 + 0.16666666666666666), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
B \cdot \mathsf{fma}\left(x, 0.3333333333333333, 0.16666666666666666\right)
\end{array}
Initial program 99.7%
Applied rewrites99.8%
Taylor expanded in B around inf
associate-/l*N/A
rgt-mult-inverseN/A
associate-*r/N/A
associate-/r*N/A
distribute-lft-out--N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
sub-negN/A
Applied rewrites99.7%
Taylor expanded in B around 0
lower-/.f64N/A
Applied rewrites51.3%
Taylor expanded in B around inf
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f642.7
Applied rewrites2.7%
herbie shell --seed 2024219
(FPCore (B x)
:name "VandenBroeck and Keller, Equation (24)"
:precision binary64
(+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))