
(FPCore (x eps) :precision binary64 (- (cos (+ x eps)) (cos x)))
double code(double x, double eps) {
return cos((x + eps)) - cos(x);
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = cos((x + eps)) - cos(x)
end function
public static double code(double x, double eps) {
return Math.cos((x + eps)) - Math.cos(x);
}
def code(x, eps): return math.cos((x + eps)) - math.cos(x)
function code(x, eps) return Float64(cos(Float64(x + eps)) - cos(x)) end
function tmp = code(x, eps) tmp = cos((x + eps)) - cos(x); end
code[x_, eps_] := N[(N[Cos[N[(x + eps), $MachinePrecision]], $MachinePrecision] - N[Cos[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos \left(x + \varepsilon\right) - \cos x
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 5 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x eps) :precision binary64 (- (cos (+ x eps)) (cos x)))
double code(double x, double eps) {
return cos((x + eps)) - cos(x);
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = cos((x + eps)) - cos(x)
end function
public static double code(double x, double eps) {
return Math.cos((x + eps)) - Math.cos(x);
}
def code(x, eps): return math.cos((x + eps)) - math.cos(x)
function code(x, eps) return Float64(cos(Float64(x + eps)) - cos(x)) end
function tmp = code(x, eps) tmp = cos((x + eps)) - cos(x); end
code[x_, eps_] := N[(N[Cos[N[(x + eps), $MachinePrecision]], $MachinePrecision] - N[Cos[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos \left(x + \varepsilon\right) - \cos x
\end{array}
(FPCore (x eps) :precision binary64 (* (sin (* eps 0.5)) (* -2.0 (sin (* 0.5 (- eps (* -2.0 x)))))))
double code(double x, double eps) {
return sin((eps * 0.5)) * (-2.0 * sin((0.5 * (eps - (-2.0 * x)))));
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = sin((eps * 0.5d0)) * ((-2.0d0) * sin((0.5d0 * (eps - ((-2.0d0) * x)))))
end function
public static double code(double x, double eps) {
return Math.sin((eps * 0.5)) * (-2.0 * Math.sin((0.5 * (eps - (-2.0 * x)))));
}
def code(x, eps): return math.sin((eps * 0.5)) * (-2.0 * math.sin((0.5 * (eps - (-2.0 * x)))))
function code(x, eps) return Float64(sin(Float64(eps * 0.5)) * Float64(-2.0 * sin(Float64(0.5 * Float64(eps - Float64(-2.0 * x)))))) end
function tmp = code(x, eps) tmp = sin((eps * 0.5)) * (-2.0 * sin((0.5 * (eps - (-2.0 * x))))); end
code[x_, eps_] := N[(N[Sin[N[(eps * 0.5), $MachinePrecision]], $MachinePrecision] * N[(-2.0 * N[Sin[N[(0.5 * N[(eps - N[(-2.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sin \left(\varepsilon \cdot 0.5\right) \cdot \left(-2 \cdot \sin \left(0.5 \cdot \left(\varepsilon - -2 \cdot x\right)\right)\right)
\end{array}
Initial program 53.0%
diff-cos79.5%
div-inv79.5%
associate--l+79.5%
metadata-eval79.5%
div-inv79.5%
+-commutative79.5%
associate-+l+79.5%
metadata-eval79.5%
Applied egg-rr79.5%
associate-*r*79.5%
*-commutative79.5%
associate-*l*79.5%
sub-neg79.5%
mul-1-neg79.5%
+-commutative79.5%
associate-+r+99.7%
mul-1-neg99.7%
sub-neg99.7%
+-inverses99.7%
remove-double-neg99.7%
mul-1-neg99.7%
sub-neg99.7%
neg-sub099.7%
mul-1-neg99.7%
remove-double-neg99.7%
*-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in x around -inf 99.7%
Final simplification99.7%
(FPCore (x eps) :precision binary64 (fma (- eps) x (* -0.5 (pow eps 2.0))))
double code(double x, double eps) {
return fma(-eps, x, (-0.5 * pow(eps, 2.0)));
}
function code(x, eps) return fma(Float64(-eps), x, Float64(-0.5 * (eps ^ 2.0))) end
code[x_, eps_] := N[((-eps) * x + N[(-0.5 * N[Power[eps, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(-\varepsilon, x, -0.5 \cdot {\varepsilon}^{2}\right)
\end{array}
Initial program 53.0%
Taylor expanded in eps around 0 99.3%
+-commutative99.3%
mul-1-neg99.3%
unsub-neg99.3%
associate-*r*99.3%
*-commutative99.3%
Simplified99.3%
Taylor expanded in x around 0 98.2%
associate-*r*98.2%
fma-define98.4%
mul-1-neg98.4%
Applied egg-rr98.4%
Final simplification98.4%
(FPCore (x eps) :precision binary64 (- (* -0.5 (pow eps 2.0)) (* eps x)))
double code(double x, double eps) {
return (-0.5 * pow(eps, 2.0)) - (eps * x);
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = ((-0.5d0) * (eps ** 2.0d0)) - (eps * x)
end function
public static double code(double x, double eps) {
return (-0.5 * Math.pow(eps, 2.0)) - (eps * x);
}
def code(x, eps): return (-0.5 * math.pow(eps, 2.0)) - (eps * x)
function code(x, eps) return Float64(Float64(-0.5 * (eps ^ 2.0)) - Float64(eps * x)) end
function tmp = code(x, eps) tmp = (-0.5 * (eps ^ 2.0)) - (eps * x); end
code[x_, eps_] := N[(N[(-0.5 * N[Power[eps, 2.0], $MachinePrecision]), $MachinePrecision] - N[(eps * x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
-0.5 \cdot {\varepsilon}^{2} - \varepsilon \cdot x
\end{array}
Initial program 53.0%
Taylor expanded in eps around 0 99.3%
+-commutative99.3%
mul-1-neg99.3%
unsub-neg99.3%
associate-*r*99.3%
*-commutative99.3%
Simplified99.3%
Taylor expanded in x around 0 98.2%
+-commutative98.2%
mul-1-neg98.2%
unsub-neg98.2%
*-commutative98.2%
Applied egg-rr98.2%
Final simplification98.2%
(FPCore (x eps) :precision binary64 (* eps (- (sin x))))
double code(double x, double eps) {
return eps * -sin(x);
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = eps * -sin(x)
end function
public static double code(double x, double eps) {
return eps * -Math.sin(x);
}
def code(x, eps): return eps * -math.sin(x)
function code(x, eps) return Float64(eps * Float64(-sin(x))) end
function tmp = code(x, eps) tmp = eps * -sin(x); end
code[x_, eps_] := N[(eps * (-N[Sin[x], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
\\
\varepsilon \cdot \left(-\sin x\right)
\end{array}
Initial program 53.0%
Taylor expanded in eps around 0 81.6%
mul-1-neg81.6%
*-commutative81.6%
distribute-rgt-neg-in81.6%
Simplified81.6%
Final simplification81.6%
(FPCore (x eps) :precision binary64 (* eps (- x)))
double code(double x, double eps) {
return eps * -x;
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = eps * -x
end function
public static double code(double x, double eps) {
return eps * -x;
}
def code(x, eps): return eps * -x
function code(x, eps) return Float64(eps * Float64(-x)) end
function tmp = code(x, eps) tmp = eps * -x; end
code[x_, eps_] := N[(eps * (-x)), $MachinePrecision]
\begin{array}{l}
\\
\varepsilon \cdot \left(-x\right)
\end{array}
Initial program 53.0%
diff-cos79.5%
*-commutative79.5%
div-inv79.5%
associate--l+79.5%
metadata-eval79.5%
div-inv79.5%
+-commutative79.5%
associate-+l+79.5%
metadata-eval79.5%
Applied egg-rr79.5%
Taylor expanded in x around 0 98.2%
Simplified98.4%
Taylor expanded in eps around 0 98.4%
Taylor expanded in x around inf 80.9%
associate-*r*80.9%
neg-mul-180.9%
Simplified80.9%
Final simplification80.9%
(FPCore (x eps) :precision binary64 (* (* -2.0 (sin (+ x (/ eps 2.0)))) (sin (/ eps 2.0))))
double code(double x, double eps) {
return (-2.0 * sin((x + (eps / 2.0)))) * sin((eps / 2.0));
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = ((-2.0d0) * sin((x + (eps / 2.0d0)))) * sin((eps / 2.0d0))
end function
public static double code(double x, double eps) {
return (-2.0 * Math.sin((x + (eps / 2.0)))) * Math.sin((eps / 2.0));
}
def code(x, eps): return (-2.0 * math.sin((x + (eps / 2.0)))) * math.sin((eps / 2.0))
function code(x, eps) return Float64(Float64(-2.0 * sin(Float64(x + Float64(eps / 2.0)))) * sin(Float64(eps / 2.0))) end
function tmp = code(x, eps) tmp = (-2.0 * sin((x + (eps / 2.0)))) * sin((eps / 2.0)); end
code[x_, eps_] := N[(N[(-2.0 * N[Sin[N[(x + N[(eps / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sin[N[(eps / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(-2 \cdot \sin \left(x + \frac{\varepsilon}{2}\right)\right) \cdot \sin \left(\frac{\varepsilon}{2}\right)
\end{array}
herbie shell --seed 2024048
(FPCore (x eps)
:name "2cos (problem 3.3.5)"
:precision binary64
:pre (and (and (and (<= -10000.0 x) (<= x 10000.0)) (< (* 1e-16 (fabs x)) eps)) (< eps (fabs x)))
:alt
(* (* -2.0 (sin (+ x (/ eps 2.0)))) (sin (/ eps 2.0)))
(- (cos (+ x eps)) (cos x)))