
(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 8 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 (fma (sin x) (- (sin eps)) (* (cos x) (+ (* -0.5 (pow eps 2.0)) (* 0.041666666666666664 (pow eps 4.0))))))
double code(double x, double eps) {
return fma(sin(x), -sin(eps), (cos(x) * ((-0.5 * pow(eps, 2.0)) + (0.041666666666666664 * pow(eps, 4.0)))));
}
function code(x, eps) return fma(sin(x), Float64(-sin(eps)), Float64(cos(x) * Float64(Float64(-0.5 * (eps ^ 2.0)) + Float64(0.041666666666666664 * (eps ^ 4.0))))) end
code[x_, eps_] := N[(N[Sin[x], $MachinePrecision] * (-N[Sin[eps], $MachinePrecision]) + N[(N[Cos[x], $MachinePrecision] * N[(N[(-0.5 * N[Power[eps, 2.0], $MachinePrecision]), $MachinePrecision] + N[(0.041666666666666664 * N[Power[eps, 4.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\sin x, -\sin \varepsilon, \cos x \cdot \left(-0.5 \cdot {\varepsilon}^{2} + 0.041666666666666664 \cdot {\varepsilon}^{4}\right)\right)
\end{array}
Initial program 55.1%
cos-sum55.2%
cancel-sign-sub-inv55.2%
add-cube-cbrt55.2%
associate-*l*55.2%
fma-def55.2%
pow255.2%
Applied egg-rr55.2%
Taylor expanded in x around inf 55.2%
associate--l+81.5%
*-commutative81.5%
neg-mul-181.5%
distribute-rgt-neg-in81.5%
fma-def81.5%
pow-base-181.5%
associate-*r*81.5%
*-lft-identity81.5%
*-commutative81.5%
*-rgt-identity81.5%
distribute-lft-out--81.5%
sub-neg81.5%
metadata-eval81.5%
+-commutative81.5%
Simplified81.5%
Taylor expanded in eps around 0 99.8%
Final simplification99.8%
(FPCore (x eps) :precision binary64 (* (sin (* 0.5 (fma 2.0 x eps))) (* -2.0 (sin (* eps 0.5)))))
double code(double x, double eps) {
return sin((0.5 * fma(2.0, x, eps))) * (-2.0 * sin((eps * 0.5)));
}
function code(x, eps) return Float64(sin(Float64(0.5 * fma(2.0, x, eps))) * Float64(-2.0 * sin(Float64(eps * 0.5)))) end
code[x_, eps_] := N[(N[Sin[N[(0.5 * N[(2.0 * x + eps), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-2.0 * N[Sin[N[(eps * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sin \left(0.5 \cdot \mathsf{fma}\left(2, x, \varepsilon\right)\right) \cdot \left(-2 \cdot \sin \left(\varepsilon \cdot 0.5\right)\right)
\end{array}
Initial program 55.1%
diff-cos81.3%
div-inv81.3%
associate--l+81.3%
metadata-eval81.3%
div-inv81.3%
+-commutative81.3%
associate-+l+81.3%
metadata-eval81.3%
Applied egg-rr81.3%
associate-*r*81.4%
*-commutative81.4%
*-commutative81.4%
+-commutative81.4%
count-281.4%
fma-def81.4%
sub-neg81.4%
mul-1-neg81.4%
+-commutative81.4%
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%
Simplified99.7%
Final simplification99.7%
(FPCore (x eps) :precision binary64 (* -2.0 (* (sin (* eps 0.5)) (sin (* 0.5 (+ eps (+ x x)))))))
double code(double x, double eps) {
return -2.0 * (sin((eps * 0.5)) * sin((0.5 * (eps + (x + x)))));
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = (-2.0d0) * (sin((eps * 0.5d0)) * sin((0.5d0 * (eps + (x + x)))))
end function
public static double code(double x, double eps) {
return -2.0 * (Math.sin((eps * 0.5)) * Math.sin((0.5 * (eps + (x + x)))));
}
def code(x, eps): return -2.0 * (math.sin((eps * 0.5)) * math.sin((0.5 * (eps + (x + x)))))
function code(x, eps) return Float64(-2.0 * Float64(sin(Float64(eps * 0.5)) * sin(Float64(0.5 * Float64(eps + Float64(x + x)))))) end
function tmp = code(x, eps) tmp = -2.0 * (sin((eps * 0.5)) * sin((0.5 * (eps + (x + x))))); end
code[x_, eps_] := N[(-2.0 * N[(N[Sin[N[(eps * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * N[(eps + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
-2 \cdot \left(\sin \left(\varepsilon \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right)\right)
\end{array}
Initial program 55.1%
diff-cos81.3%
*-commutative81.3%
div-inv81.3%
associate--l+81.3%
metadata-eval81.3%
div-inv81.3%
+-commutative81.3%
associate-+l+81.3%
metadata-eval81.3%
Applied egg-rr81.3%
Taylor expanded in x around 0 99.7%
Final simplification99.7%
(FPCore (x eps) :precision binary64 (- (* (cos x) (* -0.5 (pow eps 2.0))) (* x eps)))
double code(double x, double eps) {
return (cos(x) * (-0.5 * pow(eps, 2.0))) - (x * eps);
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = (cos(x) * ((-0.5d0) * (eps ** 2.0d0))) - (x * eps)
end function
public static double code(double x, double eps) {
return (Math.cos(x) * (-0.5 * Math.pow(eps, 2.0))) - (x * eps);
}
def code(x, eps): return (math.cos(x) * (-0.5 * math.pow(eps, 2.0))) - (x * eps)
function code(x, eps) return Float64(Float64(cos(x) * Float64(-0.5 * (eps ^ 2.0))) - Float64(x * eps)) end
function tmp = code(x, eps) tmp = (cos(x) * (-0.5 * (eps ^ 2.0))) - (x * eps); end
code[x_, eps_] := N[(N[(N[Cos[x], $MachinePrecision] * N[(-0.5 * N[Power[eps, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(x * eps), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos x \cdot \left(-0.5 \cdot {\varepsilon}^{2}\right) - x \cdot \varepsilon
\end{array}
Initial program 55.1%
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 97.3%
Final simplification97.3%
(FPCore (x eps) :precision binary64 (- (* -0.5 (pow eps 2.0)) (* x eps)))
double code(double x, double eps) {
return (-0.5 * pow(eps, 2.0)) - (x * eps);
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = ((-0.5d0) * (eps ** 2.0d0)) - (x * eps)
end function
public static double code(double x, double eps) {
return (-0.5 * Math.pow(eps, 2.0)) - (x * eps);
}
def code(x, eps): return (-0.5 * math.pow(eps, 2.0)) - (x * eps)
function code(x, eps) return Float64(Float64(-0.5 * (eps ^ 2.0)) - Float64(x * eps)) end
function tmp = code(x, eps) tmp = (-0.5 * (eps ^ 2.0)) - (x * eps); end
code[x_, eps_] := N[(N[(-0.5 * N[Power[eps, 2.0], $MachinePrecision]), $MachinePrecision] - N[(x * eps), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
-0.5 \cdot {\varepsilon}^{2} - x \cdot \varepsilon
\end{array}
Initial program 55.1%
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 97.3%
Taylor expanded in x around 0 97.3%
mul-1-neg97.3%
distribute-lft-neg-out97.3%
+-commutative97.3%
*-commutative97.3%
*-commutative97.3%
distribute-rgt-neg-in97.3%
unsub-neg97.3%
Simplified97.3%
Final simplification97.3%
(FPCore (x eps) :precision binary64 (* (sin x) (- eps)))
double code(double x, double eps) {
return sin(x) * -eps;
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = sin(x) * -eps
end function
public static double code(double x, double eps) {
return Math.sin(x) * -eps;
}
def code(x, eps): return math.sin(x) * -eps
function code(x, eps) return Float64(sin(x) * Float64(-eps)) end
function tmp = code(x, eps) tmp = sin(x) * -eps; end
code[x_, eps_] := N[(N[Sin[x], $MachinePrecision] * (-eps)), $MachinePrecision]
\begin{array}{l}
\\
\sin x \cdot \left(-\varepsilon\right)
\end{array}
Initial program 55.1%
Taylor expanded in eps around 0 81.0%
mul-1-neg81.0%
*-commutative81.0%
distribute-rgt-neg-in81.0%
Simplified81.0%
Final simplification81.0%
(FPCore (x eps) :precision binary64 (* x (- eps)))
double code(double x, double eps) {
return x * -eps;
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = x * -eps
end function
public static double code(double x, double eps) {
return x * -eps;
}
def code(x, eps): return x * -eps
function code(x, eps) return Float64(x * Float64(-eps)) end
function tmp = code(x, eps) tmp = x * -eps; end
code[x_, eps_] := N[(x * (-eps)), $MachinePrecision]
\begin{array}{l}
\\
x \cdot \left(-\varepsilon\right)
\end{array}
Initial program 55.1%
Taylor expanded in eps around 0 81.0%
mul-1-neg81.0%
*-commutative81.0%
distribute-rgt-neg-in81.0%
Simplified81.0%
Taylor expanded in x around 0 79.9%
*-commutative79.9%
associate-*r*79.9%
neg-mul-179.9%
Simplified79.9%
Final simplification79.9%
(FPCore (x eps) :precision binary64 0.0)
double code(double x, double eps) {
return 0.0;
}
real(8) function code(x, eps)
real(8), intent (in) :: x
real(8), intent (in) :: eps
code = 0.0d0
end function
public static double code(double x, double eps) {
return 0.0;
}
def code(x, eps): return 0.0
function code(x, eps) return 0.0 end
function tmp = code(x, eps) tmp = 0.0; end
code[x_, eps_] := 0.0
\begin{array}{l}
\\
0
\end{array}
Initial program 55.1%
cos-sum55.2%
cancel-sign-sub-inv55.2%
add-cube-cbrt55.2%
associate-*l*55.2%
fma-def55.2%
pow255.2%
Applied egg-rr55.2%
Taylor expanded in eps around 0 53.7%
pow-base-153.7%
*-lft-identity53.7%
+-inverses53.7%
Simplified53.7%
Final simplification53.7%
(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 2024027
(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)))
:herbie-target
(* (* -2.0 (sin (+ x (/ eps 2.0)))) (sin (/ eps 2.0)))
(- (cos (+ x eps)) (cos x)))