2cos (problem 3.3.5)

Percentage Accurate: 51.9% → 99.7%

Time: 18.1s

Alternatives: 4

Speedup: 51.3×

Specification

\[\left(\left(-10000 \leq x \land x \leq 10000\right) \land 10^{-16} \cdot \left|x\right| < \varepsilon\right) \land \varepsilon < \left|x\right|\]

Math

\[\begin{array}{l} \\ \cos \left(x + \varepsilon\right) - \cos x \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (- (cos (+ x eps)) (cos x)))

C

double code(double x, double eps) {
	return cos((x + eps)) - cos(x);
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = cos((x + eps)) - cos(x)
end function

Java

public static double code(double x, double eps) {
	return Math.cos((x + eps)) - Math.cos(x);
}

Python

def code(x, eps):
	return math.cos((x + eps)) - math.cos(x)

Julia

function code(x, eps)
	return Float64(cos(Float64(x + eps)) - cos(x))
end

MATLAB

function tmp = code(x, eps)
	tmp = cos((x + eps)) - cos(x);
end

Wolfram

code[x_, eps_] := N[(N[Cos[N[(x + eps), $MachinePrecision]], $MachinePrecision] - N[Cos[x], $MachinePrecision]), $MachinePrecision]

Initial Program: 51.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \cos \left(x + \varepsilon\right) - \cos x \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (- (cos (+ x eps)) (cos x)))

C

double code(double x, double eps) {
	return cos((x + eps)) - cos(x);
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = cos((x + eps)) - cos(x)
end function

Java

public static double code(double x, double eps) {
	return Math.cos((x + eps)) - Math.cos(x);
}

Python

def code(x, eps):
	return math.cos((x + eps)) - math.cos(x)

Julia

function code(x, eps)
	return Float64(cos(Float64(x + eps)) - cos(x))
end

MATLAB

function tmp = code(x, eps)
	tmp = cos((x + eps)) - cos(x);
end

Wolfram

code[x_, eps_] := N[(N[Cos[N[(x + eps), $MachinePrecision]], $MachinePrecision] - N[Cos[x], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(-2 \cdot \sin \left(\varepsilon \cdot 0.5\right)\right) \cdot \sin \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (* (* -2.0 (sin (* eps 0.5))) (sin (* 0.5 (+ eps (+ x x))))))

C

double code(double x, double eps) {
	return (-2.0 * sin((eps * 0.5))) * sin((0.5 * (eps + (x + x))));
}

Fortran

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

Java

public static double code(double x, double eps) {
	return (-2.0 * Math.sin((eps * 0.5))) * Math.sin((0.5 * (eps + (x + x))));
}

Python

def code(x, eps):
	return (-2.0 * math.sin((eps * 0.5))) * math.sin((0.5 * (eps + (x + x))))

Julia

function code(x, eps)
	return Float64(Float64(-2.0 * sin(Float64(eps * 0.5))) * sin(Float64(0.5 * Float64(eps + Float64(x + x)))))
end

MATLAB

function tmp = code(x, eps)
	tmp = (-2.0 * sin((eps * 0.5))) * sin((0.5 * (eps + (x + x))));
end

Wolfram

code[x_, eps_] := N[(N[(-2.0 * N[Sin[N[(eps * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sin[N[(0.5 * N[(eps + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 45.4%

   \[\cos \left(x + \varepsilon\right) - \cos x \]
2. Add Preprocessing
3. Step-by-step derivation

   1. diff-cos 78.3%

      \[\leadsto \color{blue}{-2 \cdot \left(\sin \left(\frac{\left(x + \varepsilon\right) - x}{2}\right) \cdot \sin \left(\frac{\left(x + \varepsilon\right) + x}{2}\right)\right)} \]

   2. associate-*r* 78.3%

      \[\leadsto \color{blue}{\left(-2 \cdot \sin \left(\frac{\left(x + \varepsilon\right) - x}{2}\right)\right) \cdot \sin \left(\frac{\left(x + \varepsilon\right) + x}{2}\right)} \]

   3. div-inv 78.3%

      \[\leadsto \left(-2 \cdot \sin \color{blue}{\left(\left(\left(x + \varepsilon\right) - x\right) \cdot \frac{1}{2}\right)}\right) \cdot \sin \left(\frac{\left(x + \varepsilon\right) + x}{2}\right) \]

   4. associate--l+ 78.3%

      \[\leadsto \left(-2 \cdot \sin \left(\color{blue}{\left(x + \left(\varepsilon - x\right)\right)} \cdot \frac{1}{2}\right)\right) \cdot \sin \left(\frac{\left(x + \varepsilon\right) + x}{2}\right) \]

   5. metadata-eval 78.3%

      \[\leadsto \left(-2 \cdot \sin \left(\left(x + \left(\varepsilon - x\right)\right) \cdot \color{blue}{0.5}\right)\right) \cdot \sin \left(\frac{\left(x + \varepsilon\right) + x}{2}\right) \]

   6. div-inv 78.3%

      \[\leadsto \left(-2 \cdot \sin \left(\left(x + \left(\varepsilon - x\right)\right) \cdot 0.5\right)\right) \cdot \sin \color{blue}{\left(\left(\left(x + \varepsilon\right) + x\right) \cdot \frac{1}{2}\right)} \]

   7. +-commutative 78.3%

      \[\leadsto \left(-2 \cdot \sin \left(\left(x + \left(\varepsilon - x\right)\right) \cdot 0.5\right)\right) \cdot \sin \left(\left(\color{blue}{\left(\varepsilon + x\right)} + x\right) \cdot \frac{1}{2}\right) \]

   8. associate-+l+ 78.3%

      \[\leadsto \left(-2 \cdot \sin \left(\left(x + \left(\varepsilon - x\right)\right) \cdot 0.5\right)\right) \cdot \sin \left(\color{blue}{\left(\varepsilon + \left(x + x\right)\right)} \cdot \frac{1}{2}\right) \]

   9. metadata-eval 78.3%

      \[\leadsto \left(-2 \cdot \sin \left(\left(x + \left(\varepsilon - x\right)\right) \cdot 0.5\right)\right) \cdot \sin \left(\left(\varepsilon + \left(x + x\right)\right) \cdot \color{blue}{0.5}\right) \]

4. Applied egg-rr 78.3%

   \[\leadsto \color{blue}{\left(-2 \cdot \sin \left(\left(x + \left(\varepsilon - x\right)\right) \cdot 0.5\right)\right) \cdot \sin \left(\left(\varepsilon + \left(x + x\right)\right) \cdot 0.5\right)} \]

5. Taylor expanded in x around 0 99.6%

   \[\leadsto \left(-2 \cdot \sin \left(\color{blue}{\varepsilon} \cdot 0.5\right)\right) \cdot \sin \left(\left(\varepsilon + \left(x + x\right)\right) \cdot 0.5\right) \]

6. Final simplification 99.6%

   \[\leadsto \left(-2 \cdot \sin \left(\varepsilon \cdot 0.5\right)\right) \cdot \sin \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \]
7. Add Preprocessing

Alternative 2: 97.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ -0.5 \cdot {\varepsilon}^{2} - \varepsilon \cdot x \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (- (* -0.5 (pow eps 2.0)) (* eps x)))

C

double code(double x, double eps) {
	return (-0.5 * pow(eps, 2.0)) - (eps * x);
}

Fortran

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

Java

public static double code(double x, double eps) {
	return (-0.5 * Math.pow(eps, 2.0)) - (eps * x);
}

Python

def code(x, eps):
	return (-0.5 * math.pow(eps, 2.0)) - (eps * x)

Julia

function code(x, eps)
	return Float64(Float64(-0.5 * (eps ^ 2.0)) - Float64(eps * x))
end

MATLAB

function tmp = code(x, eps)
	tmp = (-0.5 * (eps ^ 2.0)) - (eps * x);
end

Wolfram

code[x_, eps_] := N[(N[(-0.5 * N[Power[eps, 2.0], $MachinePrecision]), $MachinePrecision] - N[(eps * x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 45.4%

   \[\cos \left(x + \varepsilon\right) - \cos x \]
2. Add Preprocessing

3. Taylor expanded in eps around 0 99.0%

   \[\leadsto \color{blue}{-1 \cdot \left(\varepsilon \cdot \sin x\right) + -0.5 \cdot \left({\varepsilon}^{2} \cdot \cos x\right)} \]
4. Step-by-step derivation

   1. +-commutative 99.0%

      \[\leadsto \color{blue}{-0.5 \cdot \left({\varepsilon}^{2} \cdot \cos x\right) + -1 \cdot \left(\varepsilon \cdot \sin x\right)} \]

   2. mul-1-neg 99.0%

      \[\leadsto -0.5 \cdot \left({\varepsilon}^{2} \cdot \cos x\right) + \color{blue}{\left(-\varepsilon \cdot \sin x\right)} \]

   3. unsub-neg 99.0%

      \[\leadsto \color{blue}{-0.5 \cdot \left({\varepsilon}^{2} \cdot \cos x\right) - \varepsilon \cdot \sin x} \]

   4. *-commutative 99.0%

      \[\leadsto -0.5 \cdot \color{blue}{\left(\cos x \cdot {\varepsilon}^{2}\right)} - \varepsilon \cdot \sin x \]

   5. associate-*r* 99.0%

      \[\leadsto \color{blue}{\left(-0.5 \cdot \cos x\right) \cdot {\varepsilon}^{2}} - \varepsilon \cdot \sin x \]

5. Simplified 99.0%

   \[\leadsto \color{blue}{\left(-0.5 \cdot \cos x\right) \cdot {\varepsilon}^{2} - \varepsilon \cdot \sin x} \]

6. Taylor expanded in x around 0 97.8%

   \[\leadsto \color{blue}{-1 \cdot \left(\varepsilon \cdot x\right) + -0.5 \cdot {\varepsilon}^{2}} \]
7. Step-by-step derivation

   1. +-commutative 97.8%

      \[\leadsto \color{blue}{-0.5 \cdot {\varepsilon}^{2} + -1 \cdot \left(\varepsilon \cdot x\right)} \]

   2. mul-1-neg 97.8%

      \[\leadsto -0.5 \cdot {\varepsilon}^{2} + \color{blue}{\left(-\varepsilon \cdot x\right)} \]

   3. unsub-neg 97.8%

      \[\leadsto \color{blue}{-0.5 \cdot {\varepsilon}^{2} - \varepsilon \cdot x} \]

8. Simplified 97.8%

   \[\leadsto \color{blue}{-0.5 \cdot {\varepsilon}^{2} - \varepsilon \cdot x} \]

9. Final simplification 97.8%

   \[\leadsto -0.5 \cdot {\varepsilon}^{2} - \varepsilon \cdot x \]
10. Add Preprocessing

Alternative 3: 79.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \varepsilon \cdot \left(-\sin x\right) \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (* eps (- (sin x))))

C

double code(double x, double eps) {
	return eps * -sin(x);
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = eps * -sin(x)
end function

Java

public static double code(double x, double eps) {
	return eps * -Math.sin(x);
}

Python

def code(x, eps):
	return eps * -math.sin(x)

Julia

function code(x, eps)
	return Float64(eps * Float64(-sin(x)))
end

MATLAB

function tmp = code(x, eps)
	tmp = eps * -sin(x);
end

Wolfram

code[x_, eps_] := N[(eps * (-N[Sin[x], $MachinePrecision])), $MachinePrecision]

Derivation

1. Initial program 45.4%

   \[\cos \left(x + \varepsilon\right) - \cos x \]
2. Add Preprocessing

3. Taylor expanded in eps around 0 75.7%

   \[\leadsto \color{blue}{-1 \cdot \left(\varepsilon \cdot \sin x\right)} \]
4. Step-by-step derivation

   1. mul-1-neg 75.7%

      \[\leadsto \color{blue}{-\varepsilon \cdot \sin x} \]

   2. *-commutative 75.7%

      \[\leadsto -\color{blue}{\sin x \cdot \varepsilon} \]

   3. distribute-rgt-neg-in 75.7%

      \[\leadsto \color{blue}{\sin x \cdot \left(-\varepsilon\right)} \]

5. Simplified 75.7%

   \[\leadsto \color{blue}{\sin x \cdot \left(-\varepsilon\right)} \]

6. Final simplification 75.7%

   \[\leadsto \varepsilon \cdot \left(-\sin x\right) \]
7. Add Preprocessing

Alternative 4: 78.4% accurate, 51.3× speedup

Math

\[\begin{array}{l} \\ \varepsilon \cdot \left(-x\right) \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (* eps (- x)))

C

double code(double x, double eps) {
	return eps * -x;
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = eps * -x
end function

Java

public static double code(double x, double eps) {
	return eps * -x;
}

Python

def code(x, eps):
	return eps * -x

Julia

function code(x, eps)
	return Float64(eps * Float64(-x))
end

MATLAB

function tmp = code(x, eps)
	tmp = eps * -x;
end

Wolfram

code[x_, eps_] := N[(eps * (-x)), $MachinePrecision]

Derivation

1. Initial program 45.4%

   \[\cos \left(x + \varepsilon\right) - \cos x \]
2. Add Preprocessing

3. Taylor expanded in eps around 0 75.7%

   \[\leadsto \color{blue}{-1 \cdot \left(\varepsilon \cdot \sin x\right)} \]
4. Step-by-step derivation

   1. mul-1-neg 75.7%

      \[\leadsto \color{blue}{-\varepsilon \cdot \sin x} \]

   2. *-commutative 75.7%

      \[\leadsto -\color{blue}{\sin x \cdot \varepsilon} \]

   3. distribute-rgt-neg-in 75.7%

      \[\leadsto \color{blue}{\sin x \cdot \left(-\varepsilon\right)} \]

5. Simplified 75.7%

   \[\leadsto \color{blue}{\sin x \cdot \left(-\varepsilon\right)} \]

6. Taylor expanded in x around 0 75.1%

   \[\leadsto \color{blue}{-1 \cdot \left(\varepsilon \cdot x\right)} \]
7. Step-by-step derivation

   1. associate-*r* 75.1%

      \[\leadsto \color{blue}{\left(-1 \cdot \varepsilon\right) \cdot x} \]

   2. mul-1-neg 75.1%

      \[\leadsto \color{blue}{\left(-\varepsilon\right)} \cdot x \]

8. Simplified 75.1%

   \[\leadsto \color{blue}{\left(-\varepsilon\right) \cdot x} \]

9. Final simplification 75.1%

   \[\leadsto \varepsilon \cdot \left(-x\right) \]
10. Add Preprocessing

Developer target: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(-2 \cdot \sin \left(x + \frac{\varepsilon}{2}\right)\right) \cdot \sin \left(\frac{\varepsilon}{2}\right) \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (* (* -2.0 (sin (+ x (/ eps 2.0)))) (sin (/ eps 2.0))))

C

double code(double x, double eps) {
	return (-2.0 * sin((x + (eps / 2.0)))) * sin((eps / 2.0));
}

Fortran

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

Java

public static double code(double x, double eps) {
	return (-2.0 * Math.sin((x + (eps / 2.0)))) * Math.sin((eps / 2.0));
}

Python

def code(x, eps):
	return (-2.0 * math.sin((x + (eps / 2.0)))) * math.sin((eps / 2.0))

Julia

function code(x, eps)
	return Float64(Float64(-2.0 * sin(Float64(x + Float64(eps / 2.0)))) * sin(Float64(eps / 2.0)))
end

MATLAB

function tmp = code(x, eps)
	tmp = (-2.0 * sin((x + (eps / 2.0)))) * sin((eps / 2.0));
end

Wolfram

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]

Reproduce

herbie shell --seed 2024034 
(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)))