
(FPCore (r a b) :precision binary64 (* r (/ (sin b) (cos (+ a b)))))
double code(double r, double a, double b) {
return r * (sin(b) / cos((a + b)));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * (sin(b) / cos((a + b)))
end function
public static double code(double r, double a, double b) {
return r * (Math.sin(b) / Math.cos((a + b)));
}
def code(r, a, b): return r * (math.sin(b) / math.cos((a + b)))
function code(r, a, b) return Float64(r * Float64(sin(b) / cos(Float64(a + b)))) end
function tmp = code(r, a, b) tmp = r * (sin(b) / cos((a + b))); end
code[r_, a_, b_] := N[(r * N[(N[Sin[b], $MachinePrecision] / N[Cos[N[(a + b), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
r \cdot \frac{\sin b}{\cos \left(a + b\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (r a b) :precision binary64 (* r (/ (sin b) (cos (+ a b)))))
double code(double r, double a, double b) {
return r * (sin(b) / cos((a + b)));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * (sin(b) / cos((a + b)))
end function
public static double code(double r, double a, double b) {
return r * (Math.sin(b) / Math.cos((a + b)));
}
def code(r, a, b): return r * (math.sin(b) / math.cos((a + b)))
function code(r, a, b) return Float64(r * Float64(sin(b) / cos(Float64(a + b)))) end
function tmp = code(r, a, b) tmp = r * (sin(b) / cos((a + b))); end
code[r_, a_, b_] := N[(r * N[(N[Sin[b], $MachinePrecision] / N[Cos[N[(a + b), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
r \cdot \frac{\sin b}{\cos \left(a + b\right)}
\end{array}
(FPCore (r a b) :precision binary64 (/ (* r (sin b)) (fma (cos b) (cos a) (* (sin b) (- (sin a))))))
double code(double r, double a, double b) {
return (r * sin(b)) / fma(cos(b), cos(a), (sin(b) * -sin(a)));
}
function code(r, a, b) return Float64(Float64(r * sin(b)) / fma(cos(b), cos(a), Float64(sin(b) * Float64(-sin(a))))) end
code[r_, a_, b_] := N[(N[(r * N[Sin[b], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[b], $MachinePrecision] * N[Cos[a], $MachinePrecision] + N[(N[Sin[b], $MachinePrecision] * (-N[Sin[a], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{r \cdot \sin b}{\mathsf{fma}\left(\cos b, \cos a, \sin b \cdot \left(-\sin a\right)\right)}
\end{array}
Initial program 80.3%
associate-*r/80.3%
+-commutative80.3%
Simplified80.3%
cos-sum99.5%
cancel-sign-sub-inv99.5%
fma-def99.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (r a b) :precision binary64 (* r (/ (sin b) (- (* (cos b) (cos a)) (* (sin b) (sin a))))))
double code(double r, double a, double b) {
return r * (sin(b) / ((cos(b) * cos(a)) - (sin(b) * sin(a))));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * (sin(b) / ((cos(b) * cos(a)) - (sin(b) * sin(a))))
end function
public static double code(double r, double a, double b) {
return r * (Math.sin(b) / ((Math.cos(b) * Math.cos(a)) - (Math.sin(b) * Math.sin(a))));
}
def code(r, a, b): return r * (math.sin(b) / ((math.cos(b) * math.cos(a)) - (math.sin(b) * math.sin(a))))
function code(r, a, b) return Float64(r * Float64(sin(b) / Float64(Float64(cos(b) * cos(a)) - Float64(sin(b) * sin(a))))) end
function tmp = code(r, a, b) tmp = r * (sin(b) / ((cos(b) * cos(a)) - (sin(b) * sin(a)))); end
code[r_, a_, b_] := N[(r * N[(N[Sin[b], $MachinePrecision] / N[(N[(N[Cos[b], $MachinePrecision] * N[Cos[a], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[b], $MachinePrecision] * N[Sin[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
r \cdot \frac{\sin b}{\cos b \cdot \cos a - \sin b \cdot \sin a}
\end{array}
Initial program 80.3%
remove-double-neg80.3%
remove-double-neg80.3%
+-commutative80.3%
Simplified80.3%
cos-sum99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (r a b) :precision binary64 (if (<= b -0.00011) (* (sin b) (/ r (cos b))) (if (<= b 5.7e-5) (* b (/ r (cos a))) (* r (tan b)))))
double code(double r, double a, double b) {
double tmp;
if (b <= -0.00011) {
tmp = sin(b) * (r / cos(b));
} else if (b <= 5.7e-5) {
tmp = b * (r / cos(a));
} else {
tmp = r * tan(b);
}
return tmp;
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if (b <= (-0.00011d0)) then
tmp = sin(b) * (r / cos(b))
else if (b <= 5.7d-5) then
tmp = b * (r / cos(a))
else
tmp = r * tan(b)
end if
code = tmp
end function
public static double code(double r, double a, double b) {
double tmp;
if (b <= -0.00011) {
tmp = Math.sin(b) * (r / Math.cos(b));
} else if (b <= 5.7e-5) {
tmp = b * (r / Math.cos(a));
} else {
tmp = r * Math.tan(b);
}
return tmp;
}
def code(r, a, b): tmp = 0 if b <= -0.00011: tmp = math.sin(b) * (r / math.cos(b)) elif b <= 5.7e-5: tmp = b * (r / math.cos(a)) else: tmp = r * math.tan(b) return tmp
function code(r, a, b) tmp = 0.0 if (b <= -0.00011) tmp = Float64(sin(b) * Float64(r / cos(b))); elseif (b <= 5.7e-5) tmp = Float64(b * Float64(r / cos(a))); else tmp = Float64(r * tan(b)); end return tmp end
function tmp_2 = code(r, a, b) tmp = 0.0; if (b <= -0.00011) tmp = sin(b) * (r / cos(b)); elseif (b <= 5.7e-5) tmp = b * (r / cos(a)); else tmp = r * tan(b); end tmp_2 = tmp; end
code[r_, a_, b_] := If[LessEqual[b, -0.00011], N[(N[Sin[b], $MachinePrecision] * N[(r / N[Cos[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 5.7e-5], N[(b * N[(r / N[Cos[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(r * N[Tan[b], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq -0.00011:\\
\;\;\;\;\sin b \cdot \frac{r}{\cos b}\\
\mathbf{elif}\;b \leq 5.7 \cdot 10^{-5}:\\
\;\;\;\;b \cdot \frac{r}{\cos a}\\
\mathbf{else}:\\
\;\;\;\;r \cdot \tan b\\
\end{array}
\end{array}
if b < -1.10000000000000004e-4Initial program 56.0%
remove-double-neg56.0%
remove-double-neg56.0%
+-commutative56.0%
Simplified56.0%
Taylor expanded in a around 0 55.4%
associate-/l*55.4%
associate-/r/55.5%
Simplified55.5%
if -1.10000000000000004e-4 < b < 5.7000000000000003e-5Initial program 99.5%
associate-*r/99.4%
+-commutative99.4%
Simplified99.4%
cos-sum99.8%
cancel-sign-sub-inv99.8%
fma-def99.8%
Applied egg-rr99.8%
Taylor expanded in b around 0 99.4%
*-commutative99.4%
associate-/l*99.4%
associate-/r/99.5%
Simplified99.5%
if 5.7000000000000003e-5 < b Initial program 62.8%
associate-*r/62.9%
+-commutative62.9%
Simplified62.9%
clear-num62.8%
associate-/r/62.8%
Applied egg-rr62.8%
Taylor expanded in a around 0 61.4%
*-commutative61.4%
associate-*r*61.4%
div-inv61.5%
log1p-expm1-u60.0%
log1p-def59.8%
expm1-log1p-u40.0%
expm1-udef12.8%
log1p-def12.8%
log1p-expm1-u12.8%
quot-tan12.8%
Applied egg-rr12.8%
expm1-def40.5%
expm1-log1p61.6%
Simplified61.6%
Final simplification79.9%
(FPCore (r a b) :precision binary64 (* r (/ (sin b) (cos (+ b a)))))
double code(double r, double a, double b) {
return r * (sin(b) / cos((b + a)));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * (sin(b) / cos((b + a)))
end function
public static double code(double r, double a, double b) {
return r * (Math.sin(b) / Math.cos((b + a)));
}
def code(r, a, b): return r * (math.sin(b) / math.cos((b + a)))
function code(r, a, b) return Float64(r * Float64(sin(b) / cos(Float64(b + a)))) end
function tmp = code(r, a, b) tmp = r * (sin(b) / cos((b + a))); end
code[r_, a_, b_] := N[(r * N[(N[Sin[b], $MachinePrecision] / N[Cos[N[(b + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
r \cdot \frac{\sin b}{\cos \left(b + a\right)}
\end{array}
Initial program 80.3%
Final simplification80.3%
(FPCore (r a b) :precision binary64 (if (or (<= b -1.36e-7) (not (<= b 3.25e-6))) (* r (tan b)) (* r (/ b (cos a)))))
double code(double r, double a, double b) {
double tmp;
if ((b <= -1.36e-7) || !(b <= 3.25e-6)) {
tmp = r * tan(b);
} else {
tmp = r * (b / cos(a));
}
return tmp;
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((b <= (-1.36d-7)) .or. (.not. (b <= 3.25d-6))) then
tmp = r * tan(b)
else
tmp = r * (b / cos(a))
end if
code = tmp
end function
public static double code(double r, double a, double b) {
double tmp;
if ((b <= -1.36e-7) || !(b <= 3.25e-6)) {
tmp = r * Math.tan(b);
} else {
tmp = r * (b / Math.cos(a));
}
return tmp;
}
def code(r, a, b): tmp = 0 if (b <= -1.36e-7) or not (b <= 3.25e-6): tmp = r * math.tan(b) else: tmp = r * (b / math.cos(a)) return tmp
function code(r, a, b) tmp = 0.0 if ((b <= -1.36e-7) || !(b <= 3.25e-6)) tmp = Float64(r * tan(b)); else tmp = Float64(r * Float64(b / cos(a))); end return tmp end
function tmp_2 = code(r, a, b) tmp = 0.0; if ((b <= -1.36e-7) || ~((b <= 3.25e-6))) tmp = r * tan(b); else tmp = r * (b / cos(a)); end tmp_2 = tmp; end
code[r_, a_, b_] := If[Or[LessEqual[b, -1.36e-7], N[Not[LessEqual[b, 3.25e-6]], $MachinePrecision]], N[(r * N[Tan[b], $MachinePrecision]), $MachinePrecision], N[(r * N[(b / N[Cos[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq -1.36 \cdot 10^{-7} \lor \neg \left(b \leq 3.25 \cdot 10^{-6}\right):\\
\;\;\;\;r \cdot \tan b\\
\mathbf{else}:\\
\;\;\;\;r \cdot \frac{b}{\cos a}\\
\end{array}
\end{array}
if b < -1.36e-7 or 3.2499999999999998e-6 < b Initial program 59.2%
associate-*r/59.2%
+-commutative59.2%
Simplified59.2%
clear-num59.2%
associate-/r/59.2%
Applied egg-rr59.2%
Taylor expanded in a around 0 58.2%
*-commutative58.2%
associate-*r*58.1%
div-inv58.2%
log1p-expm1-u57.5%
log1p-def57.3%
expm1-log1p-u41.0%
expm1-udef15.3%
log1p-def15.3%
log1p-expm1-u15.3%
quot-tan15.3%
Applied egg-rr15.3%
expm1-def41.3%
expm1-log1p58.3%
Simplified58.3%
if -1.36e-7 < b < 3.2499999999999998e-6Initial program 99.5%
remove-double-neg99.5%
remove-double-neg99.5%
+-commutative99.5%
Simplified99.5%
Taylor expanded in b around 0 99.5%
Final simplification79.9%
(FPCore (r a b) :precision binary64 (if (or (<= b -4.8e-6) (not (<= b 5.6e-5))) (* r (tan b)) (* b (/ r (cos a)))))
double code(double r, double a, double b) {
double tmp;
if ((b <= -4.8e-6) || !(b <= 5.6e-5)) {
tmp = r * tan(b);
} else {
tmp = b * (r / cos(a));
}
return tmp;
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((b <= (-4.8d-6)) .or. (.not. (b <= 5.6d-5))) then
tmp = r * tan(b)
else
tmp = b * (r / cos(a))
end if
code = tmp
end function
public static double code(double r, double a, double b) {
double tmp;
if ((b <= -4.8e-6) || !(b <= 5.6e-5)) {
tmp = r * Math.tan(b);
} else {
tmp = b * (r / Math.cos(a));
}
return tmp;
}
def code(r, a, b): tmp = 0 if (b <= -4.8e-6) or not (b <= 5.6e-5): tmp = r * math.tan(b) else: tmp = b * (r / math.cos(a)) return tmp
function code(r, a, b) tmp = 0.0 if ((b <= -4.8e-6) || !(b <= 5.6e-5)) tmp = Float64(r * tan(b)); else tmp = Float64(b * Float64(r / cos(a))); end return tmp end
function tmp_2 = code(r, a, b) tmp = 0.0; if ((b <= -4.8e-6) || ~((b <= 5.6e-5))) tmp = r * tan(b); else tmp = b * (r / cos(a)); end tmp_2 = tmp; end
code[r_, a_, b_] := If[Or[LessEqual[b, -4.8e-6], N[Not[LessEqual[b, 5.6e-5]], $MachinePrecision]], N[(r * N[Tan[b], $MachinePrecision]), $MachinePrecision], N[(b * N[(r / N[Cos[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq -4.8 \cdot 10^{-6} \lor \neg \left(b \leq 5.6 \cdot 10^{-5}\right):\\
\;\;\;\;r \cdot \tan b\\
\mathbf{else}:\\
\;\;\;\;b \cdot \frac{r}{\cos a}\\
\end{array}
\end{array}
if b < -4.7999999999999998e-6 or 5.59999999999999992e-5 < b Initial program 59.2%
associate-*r/59.2%
+-commutative59.2%
Simplified59.2%
clear-num59.2%
associate-/r/59.2%
Applied egg-rr59.2%
Taylor expanded in a around 0 58.2%
*-commutative58.2%
associate-*r*58.1%
div-inv58.2%
log1p-expm1-u57.5%
log1p-def57.3%
expm1-log1p-u41.0%
expm1-udef15.3%
log1p-def15.3%
log1p-expm1-u15.3%
quot-tan15.3%
Applied egg-rr15.3%
expm1-def41.3%
expm1-log1p58.3%
Simplified58.3%
if -4.7999999999999998e-6 < b < 5.59999999999999992e-5Initial program 99.5%
associate-*r/99.4%
+-commutative99.4%
Simplified99.4%
cos-sum99.8%
cancel-sign-sub-inv99.8%
fma-def99.8%
Applied egg-rr99.8%
Taylor expanded in b around 0 99.4%
*-commutative99.4%
associate-/l*99.4%
associate-/r/99.5%
Simplified99.5%
Final simplification79.9%
(FPCore (r a b) :precision binary64 (* r (tan b)))
double code(double r, double a, double b) {
return r * tan(b);
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * tan(b)
end function
public static double code(double r, double a, double b) {
return r * Math.tan(b);
}
def code(r, a, b): return r * math.tan(b)
function code(r, a, b) return Float64(r * tan(b)) end
function tmp = code(r, a, b) tmp = r * tan(b); end
code[r_, a_, b_] := N[(r * N[Tan[b], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
r \cdot \tan b
\end{array}
Initial program 80.3%
associate-*r/80.3%
+-commutative80.3%
Simplified80.3%
clear-num79.7%
associate-/r/80.2%
Applied egg-rr80.2%
Taylor expanded in a around 0 63.0%
*-commutative63.0%
associate-*r*62.9%
div-inv63.0%
log1p-expm1-u62.6%
log1p-def42.1%
expm1-log1p-u34.3%
expm1-udef21.9%
log1p-def26.7%
log1p-expm1-u26.7%
quot-tan26.7%
Applied egg-rr26.7%
expm1-def52.1%
expm1-log1p63.0%
Simplified63.0%
Final simplification63.0%
(FPCore (r a b) :precision binary64 (* r b))
double code(double r, double a, double b) {
return r * b;
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * b
end function
public static double code(double r, double a, double b) {
return r * b;
}
def code(r, a, b): return r * b
function code(r, a, b) return Float64(r * b) end
function tmp = code(r, a, b) tmp = r * b; end
code[r_, a_, b_] := N[(r * b), $MachinePrecision]
\begin{array}{l}
\\
r \cdot b
\end{array}
Initial program 80.3%
remove-double-neg80.3%
remove-double-neg80.3%
+-commutative80.3%
Simplified80.3%
Taylor expanded in b around 0 54.1%
Taylor expanded in a around 0 37.3%
*-commutative37.3%
Simplified37.3%
Final simplification37.3%
herbie shell --seed 2024019
(FPCore (r a b)
:name "rsin B (should all be same)"
:precision binary64
(* r (/ (sin b) (cos (+ a b)))))