
(FPCore (x eps) :precision binary64 (- (tan (+ x eps)) (tan x)))
double code(double x, double eps) {
return tan((x + eps)) - tan(x);
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = tan((x + eps)) - tan(x)
end function
public static double code(double x, double eps) {
return Math.tan((x + eps)) - Math.tan(x);
}
def code(x, eps): return math.tan((x + eps)) - math.tan(x)
function code(x, eps) return Float64(tan(Float64(x + eps)) - tan(x)) end
function tmp = code(x, eps) tmp = tan((x + eps)) - tan(x); end
code[x_, eps_] := N[(N[Tan[N[(x + eps), $MachinePrecision]], $MachinePrecision] - N[Tan[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\tan \left(x + \varepsilon\right) - \tan x
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x eps) :precision binary64 (- (tan (+ x eps)) (tan x)))
double code(double x, double eps) {
return tan((x + eps)) - tan(x);
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = tan((x + eps)) - tan(x)
end function
public static double code(double x, double eps) {
return Math.tan((x + eps)) - Math.tan(x);
}
def code(x, eps): return math.tan((x + eps)) - math.tan(x)
function code(x, eps) return Float64(tan(Float64(x + eps)) - tan(x)) end
function tmp = code(x, eps) tmp = tan((x + eps)) - tan(x); end
code[x_, eps_] := N[(N[Tan[N[(x + eps), $MachinePrecision]], $MachinePrecision] - N[Tan[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\tan \left(x + \varepsilon\right) - \tan x
\end{array}
(FPCore (x eps)
:precision binary64
(let* ((t_0 (- 1.0 (* (tan x) (tan eps)))) (t_1 (+ (tan x) (tan eps))))
(if (<= eps -3.2e-9)
(fma (/ 1.0 t_0) t_1 (- (tan x)))
(if (<= eps 6.5e-28)
(fma eps (pow (tan x) 2.0) eps)
(- (/ t_1 t_0) (tan x))))))
double code(double x, double eps) {
double t_0 = 1.0 - (tan(x) * tan(eps));
double t_1 = tan(x) + tan(eps);
double tmp;
if (eps <= -3.2e-9) {
tmp = fma((1.0 / t_0), t_1, -tan(x));
} else if (eps <= 6.5e-28) {
tmp = fma(eps, pow(tan(x), 2.0), eps);
} else {
tmp = (t_1 / t_0) - tan(x);
}
return tmp;
}
function code(x, eps) t_0 = Float64(1.0 - Float64(tan(x) * tan(eps))) t_1 = Float64(tan(x) + tan(eps)) tmp = 0.0 if (eps <= -3.2e-9) tmp = fma(Float64(1.0 / t_0), t_1, Float64(-tan(x))); elseif (eps <= 6.5e-28) tmp = fma(eps, (tan(x) ^ 2.0), eps); else tmp = Float64(Float64(t_1 / t_0) - tan(x)); end return tmp end
code[x_, eps_] := Block[{t$95$0 = N[(1.0 - N[(N[Tan[x], $MachinePrecision] * N[Tan[eps], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Tan[x], $MachinePrecision] + N[Tan[eps], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[eps, -3.2e-9], N[(N[(1.0 / t$95$0), $MachinePrecision] * t$95$1 + (-N[Tan[x], $MachinePrecision])), $MachinePrecision], If[LessEqual[eps, 6.5e-28], N[(eps * N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision] + eps), $MachinePrecision], N[(N[(t$95$1 / t$95$0), $MachinePrecision] - N[Tan[x], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 1 - \tan x \cdot \tan \varepsilon\\
t_1 := \tan x + \tan \varepsilon\\
\mathbf{if}\;\varepsilon \leq -3.2 \cdot 10^{-9}:\\
\;\;\;\;\mathsf{fma}\left(\frac{1}{t_0}, t_1, -\tan x\right)\\
\mathbf{elif}\;\varepsilon \leq 6.5 \cdot 10^{-28}:\\
\;\;\;\;\mathsf{fma}\left(\varepsilon, {\tan x}^{2}, \varepsilon\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{t_1}{t_0} - \tan x\\
\end{array}
\end{array}
if eps < -3.20000000000000012e-9Initial program 47.5%
tan-sum99.3%
div-inv99.2%
*-un-lft-identity99.2%
prod-diff99.3%
*-commutative99.3%
*-un-lft-identity99.3%
*-commutative99.3%
*-un-lft-identity99.3%
Applied egg-rr99.3%
+-commutative99.3%
fma-udef99.2%
associate-+r+99.2%
unsub-neg99.2%
Simplified99.3%
clear-num99.2%
associate-/r/99.2%
fma-neg99.3%
Applied egg-rr99.3%
if -3.20000000000000012e-9 < eps < 6.50000000000000043e-28Initial program 28.8%
Taylor expanded in eps around 0 99.5%
cancel-sign-sub-inv99.5%
metadata-eval99.5%
*-lft-identity99.5%
Simplified99.5%
distribute-lft-in99.6%
*-rgt-identity99.6%
unpow299.6%
unpow299.6%
frac-times99.5%
tan-quot99.6%
tan-quot99.6%
pow299.6%
Applied egg-rr99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
if 6.50000000000000043e-28 < eps Initial program 50.9%
tan-sum99.5%
div-inv99.5%
*-un-lft-identity99.5%
prod-diff99.4%
*-commutative99.4%
*-un-lft-identity99.4%
*-commutative99.4%
*-un-lft-identity99.4%
Applied egg-rr99.4%
+-commutative99.4%
fma-udef99.5%
associate-+r+99.5%
unsub-neg99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (x eps) :precision binary64 (if (or (<= eps -5e-9) (not (<= eps 6.5e-28))) (- (/ (+ (tan x) (tan eps)) (- 1.0 (* (tan x) (tan eps)))) (tan x)) (fma eps (pow (tan x) 2.0) eps)))
double code(double x, double eps) {
double tmp;
if ((eps <= -5e-9) || !(eps <= 6.5e-28)) {
tmp = ((tan(x) + tan(eps)) / (1.0 - (tan(x) * tan(eps)))) - tan(x);
} else {
tmp = fma(eps, pow(tan(x), 2.0), eps);
}
return tmp;
}
function code(x, eps) tmp = 0.0 if ((eps <= -5e-9) || !(eps <= 6.5e-28)) tmp = Float64(Float64(Float64(tan(x) + tan(eps)) / Float64(1.0 - Float64(tan(x) * tan(eps)))) - tan(x)); else tmp = fma(eps, (tan(x) ^ 2.0), eps); end return tmp end
code[x_, eps_] := If[Or[LessEqual[eps, -5e-9], N[Not[LessEqual[eps, 6.5e-28]], $MachinePrecision]], N[(N[(N[(N[Tan[x], $MachinePrecision] + N[Tan[eps], $MachinePrecision]), $MachinePrecision] / N[(1.0 - N[(N[Tan[x], $MachinePrecision] * N[Tan[eps], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Tan[x], $MachinePrecision]), $MachinePrecision], N[(eps * N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision] + eps), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\varepsilon \leq -5 \cdot 10^{-9} \lor \neg \left(\varepsilon \leq 6.5 \cdot 10^{-28}\right):\\
\;\;\;\;\frac{\tan x + \tan \varepsilon}{1 - \tan x \cdot \tan \varepsilon} - \tan x\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\varepsilon, {\tan x}^{2}, \varepsilon\right)\\
\end{array}
\end{array}
if eps < -5.0000000000000001e-9 or 6.50000000000000043e-28 < eps Initial program 49.4%
tan-sum99.4%
div-inv99.3%
*-un-lft-identity99.3%
prod-diff99.4%
*-commutative99.4%
*-un-lft-identity99.4%
*-commutative99.4%
*-un-lft-identity99.4%
Applied egg-rr99.4%
+-commutative99.4%
fma-udef99.3%
associate-+r+99.3%
unsub-neg99.3%
Simplified99.4%
if -5.0000000000000001e-9 < eps < 6.50000000000000043e-28Initial program 28.8%
Taylor expanded in eps around 0 99.5%
cancel-sign-sub-inv99.5%
metadata-eval99.5%
*-lft-identity99.5%
Simplified99.5%
distribute-lft-in99.6%
*-rgt-identity99.6%
unpow299.6%
unpow299.6%
frac-times99.5%
tan-quot99.6%
tan-quot99.6%
pow299.6%
Applied egg-rr99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
Final simplification99.5%
(FPCore (x eps) :precision binary64 (if (or (<= eps -8.5e-6) (not (<= eps 6.5e-28))) (tan eps) (fma eps (pow (tan x) 2.0) eps)))
double code(double x, double eps) {
double tmp;
if ((eps <= -8.5e-6) || !(eps <= 6.5e-28)) {
tmp = tan(eps);
} else {
tmp = fma(eps, pow(tan(x), 2.0), eps);
}
return tmp;
}
function code(x, eps) tmp = 0.0 if ((eps <= -8.5e-6) || !(eps <= 6.5e-28)) tmp = tan(eps); else tmp = fma(eps, (tan(x) ^ 2.0), eps); end return tmp end
code[x_, eps_] := If[Or[LessEqual[eps, -8.5e-6], N[Not[LessEqual[eps, 6.5e-28]], $MachinePrecision]], N[Tan[eps], $MachinePrecision], N[(eps * N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision] + eps), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\varepsilon \leq -8.5 \cdot 10^{-6} \lor \neg \left(\varepsilon \leq 6.5 \cdot 10^{-28}\right):\\
\;\;\;\;\tan \varepsilon\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\varepsilon, {\tan x}^{2}, \varepsilon\right)\\
\end{array}
\end{array}
if eps < -8.4999999999999999e-6 or 6.50000000000000043e-28 < eps Initial program 49.4%
Taylor expanded in x around 0 51.7%
tan-quot52.0%
expm1-log1p-u42.8%
expm1-udef40.8%
Applied egg-rr40.8%
expm1-def42.8%
expm1-log1p52.0%
Simplified52.0%
if -8.4999999999999999e-6 < eps < 6.50000000000000043e-28Initial program 28.8%
Taylor expanded in eps around 0 99.5%
cancel-sign-sub-inv99.5%
metadata-eval99.5%
*-lft-identity99.5%
Simplified99.5%
distribute-lft-in99.6%
*-rgt-identity99.6%
unpow299.6%
unpow299.6%
frac-times99.5%
tan-quot99.6%
tan-quot99.6%
pow299.6%
Applied egg-rr99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
Final simplification76.6%
(FPCore (x eps) :precision binary64 (if (or (<= eps -9.6e-6) (not (<= eps 6.5e-28))) (tan eps) (* eps (+ 1.0 (pow (tan x) 2.0)))))
double code(double x, double eps) {
double tmp;
if ((eps <= -9.6e-6) || !(eps <= 6.5e-28)) {
tmp = tan(eps);
} else {
tmp = eps * (1.0 + pow(tan(x), 2.0));
}
return tmp;
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
real(8) :: tmp
if ((eps <= (-9.6d-6)) .or. (.not. (eps <= 6.5d-28))) then
tmp = tan(eps)
else
tmp = eps * (1.0d0 + (tan(x) ** 2.0d0))
end if
code = tmp
end function
public static double code(double x, double eps) {
double tmp;
if ((eps <= -9.6e-6) || !(eps <= 6.5e-28)) {
tmp = Math.tan(eps);
} else {
tmp = eps * (1.0 + Math.pow(Math.tan(x), 2.0));
}
return tmp;
}
def code(x, eps): tmp = 0 if (eps <= -9.6e-6) or not (eps <= 6.5e-28): tmp = math.tan(eps) else: tmp = eps * (1.0 + math.pow(math.tan(x), 2.0)) return tmp
function code(x, eps) tmp = 0.0 if ((eps <= -9.6e-6) || !(eps <= 6.5e-28)) tmp = tan(eps); else tmp = Float64(eps * Float64(1.0 + (tan(x) ^ 2.0))); end return tmp end
function tmp_2 = code(x, eps) tmp = 0.0; if ((eps <= -9.6e-6) || ~((eps <= 6.5e-28))) tmp = tan(eps); else tmp = eps * (1.0 + (tan(x) ^ 2.0)); end tmp_2 = tmp; end
code[x_, eps_] := If[Or[LessEqual[eps, -9.6e-6], N[Not[LessEqual[eps, 6.5e-28]], $MachinePrecision]], N[Tan[eps], $MachinePrecision], N[(eps * N[(1.0 + N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\varepsilon \leq -9.6 \cdot 10^{-6} \lor \neg \left(\varepsilon \leq 6.5 \cdot 10^{-28}\right):\\
\;\;\;\;\tan \varepsilon\\
\mathbf{else}:\\
\;\;\;\;\varepsilon \cdot \left(1 + {\tan x}^{2}\right)\\
\end{array}
\end{array}
if eps < -9.5999999999999996e-6 or 6.50000000000000043e-28 < eps Initial program 49.4%
Taylor expanded in x around 0 51.7%
tan-quot52.0%
expm1-log1p-u42.8%
expm1-udef40.8%
Applied egg-rr40.8%
expm1-def42.8%
expm1-log1p52.0%
Simplified52.0%
if -9.5999999999999996e-6 < eps < 6.50000000000000043e-28Initial program 28.8%
Taylor expanded in eps around 0 99.5%
cancel-sign-sub-inv99.5%
metadata-eval99.5%
*-lft-identity99.5%
Simplified99.5%
unpow299.5%
unpow299.5%
frac-times99.4%
tan-quot99.5%
tan-quot99.5%
Applied egg-rr99.5%
unpow299.5%
Simplified99.5%
Final simplification76.5%
(FPCore (x eps) :precision binary64 (if (or (<= eps -1.15e-5) (not (<= eps 6.5e-28))) (tan eps) (+ eps (* eps (pow (tan x) 2.0)))))
double code(double x, double eps) {
double tmp;
if ((eps <= -1.15e-5) || !(eps <= 6.5e-28)) {
tmp = tan(eps);
} else {
tmp = eps + (eps * pow(tan(x), 2.0));
}
return tmp;
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
real(8) :: tmp
if ((eps <= (-1.15d-5)) .or. (.not. (eps <= 6.5d-28))) then
tmp = tan(eps)
else
tmp = eps + (eps * (tan(x) ** 2.0d0))
end if
code = tmp
end function
public static double code(double x, double eps) {
double tmp;
if ((eps <= -1.15e-5) || !(eps <= 6.5e-28)) {
tmp = Math.tan(eps);
} else {
tmp = eps + (eps * Math.pow(Math.tan(x), 2.0));
}
return tmp;
}
def code(x, eps): tmp = 0 if (eps <= -1.15e-5) or not (eps <= 6.5e-28): tmp = math.tan(eps) else: tmp = eps + (eps * math.pow(math.tan(x), 2.0)) return tmp
function code(x, eps) tmp = 0.0 if ((eps <= -1.15e-5) || !(eps <= 6.5e-28)) tmp = tan(eps); else tmp = Float64(eps + Float64(eps * (tan(x) ^ 2.0))); end return tmp end
function tmp_2 = code(x, eps) tmp = 0.0; if ((eps <= -1.15e-5) || ~((eps <= 6.5e-28))) tmp = tan(eps); else tmp = eps + (eps * (tan(x) ^ 2.0)); end tmp_2 = tmp; end
code[x_, eps_] := If[Or[LessEqual[eps, -1.15e-5], N[Not[LessEqual[eps, 6.5e-28]], $MachinePrecision]], N[Tan[eps], $MachinePrecision], N[(eps + N[(eps * N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\varepsilon \leq -1.15 \cdot 10^{-5} \lor \neg \left(\varepsilon \leq 6.5 \cdot 10^{-28}\right):\\
\;\;\;\;\tan \varepsilon\\
\mathbf{else}:\\
\;\;\;\;\varepsilon + \varepsilon \cdot {\tan x}^{2}\\
\end{array}
\end{array}
if eps < -1.15e-5 or 6.50000000000000043e-28 < eps Initial program 49.4%
Taylor expanded in x around 0 51.7%
tan-quot52.0%
expm1-log1p-u42.8%
expm1-udef40.8%
Applied egg-rr40.8%
expm1-def42.8%
expm1-log1p52.0%
Simplified52.0%
if -1.15e-5 < eps < 6.50000000000000043e-28Initial program 28.8%
Taylor expanded in eps around 0 99.5%
cancel-sign-sub-inv99.5%
metadata-eval99.5%
*-lft-identity99.5%
Simplified99.5%
+-commutative99.5%
distribute-lft-in99.6%
unpow299.6%
unpow299.6%
frac-times99.5%
tan-quot99.6%
tan-quot99.6%
pow299.6%
*-rgt-identity99.6%
Applied egg-rr99.6%
Final simplification76.5%
(FPCore (x eps) :precision binary64 (tan eps))
double code(double x, double eps) {
return tan(eps);
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = tan(eps)
end function
public static double code(double x, double eps) {
return Math.tan(eps);
}
def code(x, eps): return math.tan(eps)
function code(x, eps) return tan(eps) end
function tmp = code(x, eps) tmp = tan(eps); end
code[x_, eps_] := N[Tan[eps], $MachinePrecision]
\begin{array}{l}
\\
\tan \varepsilon
\end{array}
Initial program 38.8%
Taylor expanded in x around 0 55.2%
tan-quot55.4%
expm1-log1p-u50.9%
expm1-udef22.8%
Applied egg-rr22.8%
expm1-def50.9%
expm1-log1p55.4%
Simplified55.4%
Final simplification55.4%
(FPCore (x eps) :precision binary64 eps)
double code(double x, double eps) {
return eps;
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = eps
end function
public static double code(double x, double eps) {
return eps;
}
def code(x, eps): return eps
function code(x, eps) return eps end
function tmp = code(x, eps) tmp = eps; end
code[x_, eps_] := eps
\begin{array}{l}
\\
\varepsilon
\end{array}
Initial program 38.8%
Taylor expanded in x around 0 55.2%
Taylor expanded in eps around 0 33.1%
Final simplification33.1%
(FPCore (x eps) :precision binary64 (/ (sin eps) (* (cos x) (cos (+ x eps)))))
double code(double x, double eps) {
return sin(eps) / (cos(x) * cos((x + eps)));
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = sin(eps) / (cos(x) * cos((x + eps)))
end function
public static double code(double x, double eps) {
return Math.sin(eps) / (Math.cos(x) * Math.cos((x + eps)));
}
def code(x, eps): return math.sin(eps) / (math.cos(x) * math.cos((x + eps)))
function code(x, eps) return Float64(sin(eps) / Float64(cos(x) * cos(Float64(x + eps)))) end
function tmp = code(x, eps) tmp = sin(eps) / (cos(x) * cos((x + eps))); end
code[x_, eps_] := N[(N[Sin[eps], $MachinePrecision] / N[(N[Cos[x], $MachinePrecision] * N[Cos[N[(x + eps), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sin \varepsilon}{\cos x \cdot \cos \left(x + \varepsilon\right)}
\end{array}
herbie shell --seed 2024019
(FPCore (x eps)
:name "2tan (problem 3.3.2)"
:precision binary64
:herbie-target
(/ (sin eps) (* (cos x) (cos (+ x eps))))
(- (tan (+ x eps)) (tan x)))