
(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 6 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 (- (tan x))))
(fma
(pow (fma (tan eps) t_0 1.0) -1.0)
(tan eps)
(/ (expm1 (- (log1p (* t_0 (tan eps))))) (pow (tan x) -1.0)))))
double code(double x, double eps) {
double t_0 = -tan(x);
return fma(pow(fma(tan(eps), t_0, 1.0), -1.0), tan(eps), (expm1(-log1p((t_0 * tan(eps)))) / pow(tan(x), -1.0)));
}
function code(x, eps) t_0 = Float64(-tan(x)) return fma((fma(tan(eps), t_0, 1.0) ^ -1.0), tan(eps), Float64(expm1(Float64(-log1p(Float64(t_0 * tan(eps))))) / (tan(x) ^ -1.0))) end
code[x_, eps_] := Block[{t$95$0 = (-N[Tan[x], $MachinePrecision])}, N[(N[Power[N[(N[Tan[eps], $MachinePrecision] * t$95$0 + 1.0), $MachinePrecision], -1.0], $MachinePrecision] * N[Tan[eps], $MachinePrecision] + N[(N[(Exp[(-N[Log[1 + N[(t$95$0 * N[Tan[eps], $MachinePrecision]), $MachinePrecision]], $MachinePrecision])] - 1), $MachinePrecision] / N[Power[N[Tan[x], $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := -\tan x\\
\mathsf{fma}\left({\left(\mathsf{fma}\left(\tan \varepsilon, t\_0, 1\right)\right)}^{-1}, \tan \varepsilon, \frac{\mathsf{expm1}\left(-\mathsf{log1p}\left(t\_0 \cdot \tan \varepsilon\right)\right)}{{\tan x}^{-1}}\right)
\end{array}
\end{array}
Initial program 60.6%
Taylor expanded in eps around 0
associate--l+N/A
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
lower-fma.f64N/A
Applied rewrites98.9%
Taylor expanded in x around inf
lower--.f64N/A
lower-/.f64N/A
lower-sin.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-cos.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-sin.f64N/A
lower-cos.f6460.6
Applied rewrites60.6%
Applied rewrites100.0%
Final simplification100.0%
(FPCore (x eps) :precision binary64 (fma (fma (fma (tan x) (tan x) 1.0) (* (tan x) eps) (pow (tan x) 2.0)) eps eps))
double code(double x, double eps) {
return fma(fma(fma(tan(x), tan(x), 1.0), (tan(x) * eps), pow(tan(x), 2.0)), eps, eps);
}
function code(x, eps) return fma(fma(fma(tan(x), tan(x), 1.0), Float64(tan(x) * eps), (tan(x) ^ 2.0)), eps, eps) end
code[x_, eps_] := N[(N[(N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[Tan[x], $MachinePrecision] * eps), $MachinePrecision] + N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * eps + eps), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\tan x, \tan x, 1\right), \tan x \cdot \varepsilon, {\tan x}^{2}\right), \varepsilon, \varepsilon\right)
\end{array}
Initial program 60.6%
Taylor expanded in eps around 0
associate--l+N/A
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
lower-fma.f64N/A
Applied rewrites98.9%
Applied rewrites98.9%
Applied rewrites98.9%
Applied rewrites98.9%
Final simplification98.9%
(FPCore (x eps) :precision binary64 (fma (/ (pow (sin x) 2.0) (pow (cos x) 2.0)) eps eps))
double code(double x, double eps) {
return fma((pow(sin(x), 2.0) / pow(cos(x), 2.0)), eps, eps);
}
function code(x, eps) return fma(Float64((sin(x) ^ 2.0) / (cos(x) ^ 2.0)), eps, eps) end
code[x_, eps_] := N[(N[(N[Power[N[Sin[x], $MachinePrecision], 2.0], $MachinePrecision] / N[Power[N[Cos[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * eps + eps), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\frac{{\sin x}^{2}}{{\cos x}^{2}}, \varepsilon, \varepsilon\right)
\end{array}
Initial program 60.6%
Taylor expanded in eps around 0
sub-negN/A
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
lower-fma.f64N/A
mul-1-negN/A
remove-double-negN/A
lower-/.f64N/A
lower-pow.f64N/A
lower-sin.f64N/A
lower-pow.f64N/A
lower-cos.f6498.6
Applied rewrites98.6%
(FPCore (x eps)
:precision binary64
(fma
(*
(fma
(fma (fma 0.6666666666666666 x (* 1.3333333333333333 eps)) x 1.0)
x
eps)
x)
eps
eps))
double code(double x, double eps) {
return fma((fma(fma(fma(0.6666666666666666, x, (1.3333333333333333 * eps)), x, 1.0), x, eps) * x), eps, eps);
}
function code(x, eps) return fma(Float64(fma(fma(fma(0.6666666666666666, x, Float64(1.3333333333333333 * eps)), x, 1.0), x, eps) * x), eps, eps) end
code[x_, eps_] := N[(N[(N[(N[(N[(0.6666666666666666 * x + N[(1.3333333333333333 * eps), $MachinePrecision]), $MachinePrecision] * x + 1.0), $MachinePrecision] * x + eps), $MachinePrecision] * x), $MachinePrecision] * eps + eps), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.6666666666666666, x, 1.3333333333333333 \cdot \varepsilon\right), x, 1\right), x, \varepsilon\right) \cdot x, \varepsilon, \varepsilon\right)
\end{array}
Initial program 60.6%
Taylor expanded in eps around 0
associate--l+N/A
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
lower-fma.f64N/A
Applied rewrites98.9%
Taylor expanded in x around 0
Applied rewrites97.9%
Final simplification97.9%
(FPCore (x eps) :precision binary64 (fma (* (+ eps x) x) eps eps))
double code(double x, double eps) {
return fma(((eps + x) * x), eps, eps);
}
function code(x, eps) return fma(Float64(Float64(eps + x) * x), eps, eps) end
code[x_, eps_] := N[(N[(N[(eps + x), $MachinePrecision] * x), $MachinePrecision] * eps + eps), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\left(\varepsilon + x\right) \cdot x, \varepsilon, \varepsilon\right)
\end{array}
Initial program 60.6%
Taylor expanded in eps around 0
associate--l+N/A
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
lower-fma.f64N/A
Applied rewrites98.9%
Taylor expanded in x around 0
Applied rewrites97.6%
Final simplification97.6%
(FPCore (x eps) :precision binary64 (fma (* eps x) eps eps))
double code(double x, double eps) {
return fma((eps * x), eps, eps);
}
function code(x, eps) return fma(Float64(eps * x), eps, eps) end
code[x_, eps_] := N[(N[(eps * x), $MachinePrecision] * eps + eps), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\varepsilon \cdot x, \varepsilon, \varepsilon\right)
\end{array}
Initial program 60.6%
Taylor expanded in eps around 0
associate--l+N/A
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
lower-fma.f64N/A
Applied rewrites98.9%
Taylor expanded in x around 0
Applied rewrites97.2%
Final simplification97.2%
(FPCore (x eps) :precision binary64 (+ eps (* (* eps (tan x)) (tan x))))
double code(double x, double eps) {
return eps + ((eps * tan(x)) * tan(x));
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = eps + ((eps * tan(x)) * tan(x))
end function
public static double code(double x, double eps) {
return eps + ((eps * Math.tan(x)) * Math.tan(x));
}
def code(x, eps): return eps + ((eps * math.tan(x)) * math.tan(x))
function code(x, eps) return Float64(eps + Float64(Float64(eps * tan(x)) * tan(x))) end
function tmp = code(x, eps) tmp = eps + ((eps * tan(x)) * tan(x)); end
code[x_, eps_] := N[(eps + N[(N[(eps * N[Tan[x], $MachinePrecision]), $MachinePrecision] * N[Tan[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\varepsilon + \left(\varepsilon \cdot \tan x\right) \cdot \tan x
\end{array}
herbie shell --seed 2024296
(FPCore (x eps)
:name "2tan (problem 3.3.2)"
:precision binary64
:pre (and (and (and (<= -10000.0 x) (<= x 10000.0)) (< (* 1e-16 (fabs x)) eps)) (< eps (fabs x)))
:alt
(! :herbie-platform default (+ eps (* eps (tan x) (tan x))))
(- (tan (+ x eps)) (tan x)))