
(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 9 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
(let* ((t_0 (- (sin b))))
(/
(* r (sin b))
(+
(fma 1.0 (* (cos a) (cos b)) (* (sin a) t_0))
(fma t_0 (sin a) (* (sin b) (sin a)))))))
double code(double r, double a, double b) {
double t_0 = -sin(b);
return (r * sin(b)) / (fma(1.0, (cos(a) * cos(b)), (sin(a) * t_0)) + fma(t_0, sin(a), (sin(b) * sin(a))));
}
function code(r, a, b) t_0 = Float64(-sin(b)) return Float64(Float64(r * sin(b)) / Float64(fma(1.0, Float64(cos(a) * cos(b)), Float64(sin(a) * t_0)) + fma(t_0, sin(a), Float64(sin(b) * sin(a))))) end
code[r_, a_, b_] := Block[{t$95$0 = (-N[Sin[b], $MachinePrecision])}, N[(N[(r * N[Sin[b], $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 * N[(N[Cos[a], $MachinePrecision] * N[Cos[b], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[a], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] + N[(t$95$0 * N[Sin[a], $MachinePrecision] + N[(N[Sin[b], $MachinePrecision] * N[Sin[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := -\sin b\\
\frac{r \cdot \sin b}{\mathsf{fma}\left(1, \cos a \cdot \cos b, \sin a \cdot t_0\right) + \mathsf{fma}\left(t_0, \sin a, \sin b \cdot \sin a\right)}
\end{array}
\end{array}
Initial program 75.2%
associate-*r/75.2%
+-commutative75.2%
Simplified75.2%
cos-sum99.5%
*-un-lft-identity99.5%
*-un-lft-identity99.5%
prod-diff99.5%
Applied egg-rr99.5%
*-commutative99.5%
*-rgt-identity99.5%
distribute-lft-neg-in99.5%
*-commutative99.5%
fma-udef99.5%
*-rgt-identity99.5%
distribute-lft-neg-in99.5%
*-rgt-identity99.5%
fma-udef99.5%
*-commutative99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (r a b) :precision binary64 (* r (/ (sin b) (- (* (cos a) (cos b)) (* (sin b) (sin a))))))
double code(double r, double a, double b) {
return r * (sin(b) / ((cos(a) * cos(b)) - (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(a) * cos(b)) - (sin(b) * sin(a))))
end function
public static double code(double r, double a, double b) {
return r * (Math.sin(b) / ((Math.cos(a) * Math.cos(b)) - (Math.sin(b) * Math.sin(a))));
}
def code(r, a, b): return r * (math.sin(b) / ((math.cos(a) * math.cos(b)) - (math.sin(b) * math.sin(a))))
function code(r, a, b) return Float64(r * Float64(sin(b) / Float64(Float64(cos(a) * cos(b)) - Float64(sin(b) * sin(a))))) end
function tmp = code(r, a, b) tmp = r * (sin(b) / ((cos(a) * cos(b)) - (sin(b) * sin(a)))); end
code[r_, a_, b_] := N[(r * N[(N[Sin[b], $MachinePrecision] / N[(N[(N[Cos[a], $MachinePrecision] * N[Cos[b], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[b], $MachinePrecision] * N[Sin[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
r \cdot \frac{\sin b}{\cos a \cdot \cos b - \sin b \cdot \sin a}
\end{array}
Initial program 75.2%
+-commutative75.2%
Simplified75.2%
cos-sum99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (r a b) :precision binary64 (/ (* r (sin b)) (- (* (cos a) (cos b)) (* (sin b) (sin a)))))
double code(double r, double a, double b) {
return (r * sin(b)) / ((cos(a) * cos(b)) - (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(a) * cos(b)) - (sin(b) * sin(a)))
end function
public static double code(double r, double a, double b) {
return (r * Math.sin(b)) / ((Math.cos(a) * Math.cos(b)) - (Math.sin(b) * Math.sin(a)));
}
def code(r, a, b): return (r * math.sin(b)) / ((math.cos(a) * math.cos(b)) - (math.sin(b) * math.sin(a)))
function code(r, a, b) return Float64(Float64(r * sin(b)) / Float64(Float64(cos(a) * cos(b)) - Float64(sin(b) * sin(a)))) end
function tmp = code(r, a, b) tmp = (r * sin(b)) / ((cos(a) * cos(b)) - (sin(b) * sin(a))); end
code[r_, a_, b_] := N[(N[(r * N[Sin[b], $MachinePrecision]), $MachinePrecision] / N[(N[(N[Cos[a], $MachinePrecision] * N[Cos[b], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[b], $MachinePrecision] * N[Sin[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{r \cdot \sin b}{\cos a \cdot \cos b - \sin b \cdot \sin a}
\end{array}
Initial program 75.2%
associate-*r/75.2%
+-commutative75.2%
Simplified75.2%
cos-sum99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (r a b) :precision binary64 (if (or (<= b -1.32e-6) (not (<= b 1.75e-6))) (* r (tan b)) (* r (/ (sin b) (cos a)))))
double code(double r, double a, double b) {
double tmp;
if ((b <= -1.32e-6) || !(b <= 1.75e-6)) {
tmp = r * tan(b);
} else {
tmp = r * (sin(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.32d-6)) .or. (.not. (b <= 1.75d-6))) then
tmp = r * tan(b)
else
tmp = r * (sin(b) / cos(a))
end if
code = tmp
end function
public static double code(double r, double a, double b) {
double tmp;
if ((b <= -1.32e-6) || !(b <= 1.75e-6)) {
tmp = r * Math.tan(b);
} else {
tmp = r * (Math.sin(b) / Math.cos(a));
}
return tmp;
}
def code(r, a, b): tmp = 0 if (b <= -1.32e-6) or not (b <= 1.75e-6): tmp = r * math.tan(b) else: tmp = r * (math.sin(b) / math.cos(a)) return tmp
function code(r, a, b) tmp = 0.0 if ((b <= -1.32e-6) || !(b <= 1.75e-6)) tmp = Float64(r * tan(b)); else tmp = Float64(r * Float64(sin(b) / cos(a))); end return tmp end
function tmp_2 = code(r, a, b) tmp = 0.0; if ((b <= -1.32e-6) || ~((b <= 1.75e-6))) tmp = r * tan(b); else tmp = r * (sin(b) / cos(a)); end tmp_2 = tmp; end
code[r_, a_, b_] := If[Or[LessEqual[b, -1.32e-6], N[Not[LessEqual[b, 1.75e-6]], $MachinePrecision]], N[(r * N[Tan[b], $MachinePrecision]), $MachinePrecision], N[(r * N[(N[Sin[b], $MachinePrecision] / N[Cos[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq -1.32 \cdot 10^{-6} \lor \neg \left(b \leq 1.75 \cdot 10^{-6}\right):\\
\;\;\;\;r \cdot \tan b\\
\mathbf{else}:\\
\;\;\;\;r \cdot \frac{\sin b}{\cos a}\\
\end{array}
\end{array}
if b < -1.3200000000000001e-6 or 1.74999999999999997e-6 < b Initial program 49.3%
associate-*r/49.3%
+-commutative49.3%
Simplified49.3%
add-exp-log28.0%
Applied egg-rr28.0%
Taylor expanded in a around 0 28.0%
add-exp-log16.8%
add-exp-log24.1%
*-un-lft-identity24.1%
times-frac24.1%
/-rgt-identity24.1%
Applied egg-rr24.1%
add-exp-log49.8%
*-commutative49.8%
quot-tan49.8%
Applied egg-rr49.8%
if -1.3200000000000001e-6 < b < 1.74999999999999997e-6Initial program 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in b around 0 99.3%
Final simplification75.5%
(FPCore (r a b) :precision binary64 (if (<= b -8e-7) (* r (tan b)) (if (<= b 1.75e-6) (* r (/ (sin b) (cos a))) (* (sin b) (/ r (cos b))))))
double code(double r, double a, double b) {
double tmp;
if (b <= -8e-7) {
tmp = r * tan(b);
} else if (b <= 1.75e-6) {
tmp = r * (sin(b) / cos(a));
} else {
tmp = sin(b) * (r / cos(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 <= (-8d-7)) then
tmp = r * tan(b)
else if (b <= 1.75d-6) then
tmp = r * (sin(b) / cos(a))
else
tmp = sin(b) * (r / cos(b))
end if
code = tmp
end function
public static double code(double r, double a, double b) {
double tmp;
if (b <= -8e-7) {
tmp = r * Math.tan(b);
} else if (b <= 1.75e-6) {
tmp = r * (Math.sin(b) / Math.cos(a));
} else {
tmp = Math.sin(b) * (r / Math.cos(b));
}
return tmp;
}
def code(r, a, b): tmp = 0 if b <= -8e-7: tmp = r * math.tan(b) elif b <= 1.75e-6: tmp = r * (math.sin(b) / math.cos(a)) else: tmp = math.sin(b) * (r / math.cos(b)) return tmp
function code(r, a, b) tmp = 0.0 if (b <= -8e-7) tmp = Float64(r * tan(b)); elseif (b <= 1.75e-6) tmp = Float64(r * Float64(sin(b) / cos(a))); else tmp = Float64(sin(b) * Float64(r / cos(b))); end return tmp end
function tmp_2 = code(r, a, b) tmp = 0.0; if (b <= -8e-7) tmp = r * tan(b); elseif (b <= 1.75e-6) tmp = r * (sin(b) / cos(a)); else tmp = sin(b) * (r / cos(b)); end tmp_2 = tmp; end
code[r_, a_, b_] := If[LessEqual[b, -8e-7], N[(r * N[Tan[b], $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.75e-6], N[(r * N[(N[Sin[b], $MachinePrecision] / N[Cos[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sin[b], $MachinePrecision] * N[(r / N[Cos[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq -8 \cdot 10^{-7}:\\
\;\;\;\;r \cdot \tan b\\
\mathbf{elif}\;b \leq 1.75 \cdot 10^{-6}:\\
\;\;\;\;r \cdot \frac{\sin b}{\cos a}\\
\mathbf{else}:\\
\;\;\;\;\sin b \cdot \frac{r}{\cos b}\\
\end{array}
\end{array}
if b < -7.9999999999999996e-7Initial program 55.8%
associate-*r/55.9%
+-commutative55.9%
Simplified55.9%
add-exp-log35.4%
Applied egg-rr35.4%
Taylor expanded in a around 0 35.0%
add-exp-log18.1%
add-exp-log24.1%
*-un-lft-identity24.1%
times-frac24.1%
/-rgt-identity24.1%
Applied egg-rr24.1%
add-exp-log55.3%
*-commutative55.3%
quot-tan55.4%
Applied egg-rr55.4%
if -7.9999999999999996e-7 < b < 1.74999999999999997e-6Initial program 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in b around 0 99.3%
if 1.74999999999999997e-6 < b Initial program 43.4%
associate-*r/43.4%
+-commutative43.4%
Simplified43.4%
cos-sum99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
prod-diff99.0%
Applied egg-rr99.0%
*-commutative99.0%
*-rgt-identity99.0%
distribute-lft-neg-in99.0%
*-commutative99.0%
fma-udef99.0%
*-rgt-identity99.0%
distribute-lft-neg-in99.0%
*-rgt-identity99.0%
fma-udef99.0%
*-commutative99.0%
Simplified99.0%
Taylor expanded in r around 0 98.9%
associate-+r+99.0%
*-commutative99.0%
*-commutative99.0%
distribute-lft1-in99.0%
metadata-eval99.0%
neg-mul-199.0%
distribute-lft-neg-in99.0%
+-commutative99.0%
cancel-sign-sub-inv99.0%
*-commutative99.0%
Simplified99.0%
Taylor expanded in a around 0 44.8%
associate-*r/44.9%
Simplified44.9%
Final simplification75.5%
(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 75.2%
Final simplification75.2%
(FPCore (r a b) :precision binary64 (if (or (<= b -1.32e-6) (not (<= b 1.75e-6))) (* r (tan b)) (* r (/ b (cos a)))))
double code(double r, double a, double b) {
double tmp;
if ((b <= -1.32e-6) || !(b <= 1.75e-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.32d-6)) .or. (.not. (b <= 1.75d-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.32e-6) || !(b <= 1.75e-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.32e-6) or not (b <= 1.75e-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.32e-6) || !(b <= 1.75e-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.32e-6) || ~((b <= 1.75e-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.32e-6], N[Not[LessEqual[b, 1.75e-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.32 \cdot 10^{-6} \lor \neg \left(b \leq 1.75 \cdot 10^{-6}\right):\\
\;\;\;\;r \cdot \tan b\\
\mathbf{else}:\\
\;\;\;\;r \cdot \frac{b}{\cos a}\\
\end{array}
\end{array}
if b < -1.3200000000000001e-6 or 1.74999999999999997e-6 < b Initial program 49.3%
associate-*r/49.3%
+-commutative49.3%
Simplified49.3%
add-exp-log28.0%
Applied egg-rr28.0%
Taylor expanded in a around 0 28.0%
add-exp-log16.8%
add-exp-log24.1%
*-un-lft-identity24.1%
times-frac24.1%
/-rgt-identity24.1%
Applied egg-rr24.1%
add-exp-log49.8%
*-commutative49.8%
quot-tan49.8%
Applied egg-rr49.8%
if -1.3200000000000001e-6 < b < 1.74999999999999997e-6Initial program 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in b around 0 99.3%
Final simplification75.5%
(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 75.2%
associate-*r/75.2%
+-commutative75.2%
Simplified75.2%
add-exp-log42.7%
Applied egg-rr42.7%
Taylor expanded in a around 0 32.6%
add-exp-log27.2%
add-exp-log30.7%
*-un-lft-identity30.7%
times-frac30.7%
/-rgt-identity30.7%
Applied egg-rr30.7%
add-exp-log58.0%
*-commutative58.0%
quot-tan58.1%
Applied egg-rr58.1%
Final simplification58.1%
(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 75.2%
+-commutative75.2%
Simplified75.2%
Taylor expanded in b around 0 54.4%
Taylor expanded in a around 0 36.8%
Final simplification36.8%
herbie shell --seed 2023203
(FPCore (r a b)
:name "rsin B (should all be same)"
:precision binary64
(* r (/ (sin b) (cos (+ a b)))))