
(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 (fma (fma (/ eps (cos x)) (* (sin x) (fma (tan x) (tan x) 1.0)) (pow (tan x) 2.0)) eps eps))
double code(double x, double eps) {
return fma(fma((eps / cos(x)), (sin(x) * fma(tan(x), tan(x), 1.0)), pow(tan(x), 2.0)), eps, eps);
}
function code(x, eps) return fma(fma(Float64(eps / cos(x)), Float64(sin(x) * fma(tan(x), tan(x), 1.0)), (tan(x) ^ 2.0)), eps, eps) end
code[x_, eps_] := N[(N[(N[(eps / N[Cos[x], $MachinePrecision]), $MachinePrecision] * N[(N[Sin[x], $MachinePrecision] * N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * eps + eps), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\mathsf{fma}\left(\frac{\varepsilon}{\cos x}, \sin x \cdot \mathsf{fma}\left(\tan x, \tan x, 1\right), {\tan x}^{2}\right), \varepsilon, \varepsilon\right)
\end{array}
Initial program 62.3%
Taylor expanded in eps around 0
associate--l+N/A
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
lower-fma.f64N/A
Applied rewrites99.7%
Applied rewrites99.7%
Applied rewrites99.7%
Final simplification99.7%
(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 62.3%
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.f6499.4
Applied rewrites99.4%
(FPCore (x eps) :precision binary64 (/ (sin eps) (fma (* eps eps) -0.5 1.0)))
double code(double x, double eps) {
return sin(eps) / fma((eps * eps), -0.5, 1.0);
}
function code(x, eps) return Float64(sin(eps) / fma(Float64(eps * eps), -0.5, 1.0)) end
code[x_, eps_] := N[(N[Sin[eps], $MachinePrecision] / N[(N[(eps * eps), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sin \varepsilon}{\mathsf{fma}\left(\varepsilon \cdot \varepsilon, -0.5, 1\right)}
\end{array}
Initial program 62.3%
Taylor expanded in x around 0
lower-/.f64N/A
lower-sin.f64N/A
lower-cos.f6499.0
Applied rewrites99.0%
Taylor expanded in eps around 0
Applied rewrites99.0%
(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 62.3%
Taylor expanded in x around 0
lower-/.f64N/A
lower-sin.f64N/A
lower-cos.f6499.0
Applied rewrites99.0%
Applied rewrites99.0%
(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 62.3%
Taylor expanded in eps around 0
associate--l+N/A
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
lower-fma.f64N/A
Applied rewrites99.7%
Taylor expanded in x around 0
Applied rewrites99.0%
(FPCore (x eps) :precision binary64 (fma (* x x) eps eps))
double code(double x, double eps) {
return fma((x * x), eps, eps);
}
function code(x, eps) return fma(Float64(x * x), eps, eps) end
code[x_, eps_] := N[(N[(x * x), $MachinePrecision] * eps + eps), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x \cdot x, \varepsilon, \varepsilon\right)
\end{array}
Initial program 62.3%
Taylor expanded in eps around 0
associate--l+N/A
+-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
lower-fma.f64N/A
Applied rewrites99.7%
Taylor expanded in x around 0
Applied rewrites99.0%
Taylor expanded in x around 0
Applied rewrites99.0%
Taylor expanded in eps around 0
Applied rewrites99.0%
(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 2024270
(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)))