2sin (example 3.3)

Percentage Accurate: 62.6% → 99.7%

Time: 12.9s

Alternatives: 9

Speedup: 205.0×

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} \\ \sin \left(x + \varepsilon\right) - \sin x \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 62.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = eps * (cos(x) + (eps * (((-0.5d0) * sin(x)) + ((-0.16666666666666666d0) * (eps * cos(x))))))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.6%

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

3. Taylor expanded in eps around 0 99.7%

   \[\leadsto \color{blue}{\varepsilon \cdot \left(\cos x + \varepsilon \cdot \left(-0.5 \cdot \sin x + -0.16666666666666666 \cdot \left(\varepsilon \cdot \cos x\right)\right)\right)} \]
4. Add Preprocessing

Alternative 2: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.6%

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

3. Taylor expanded in eps around 0 99.7%

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

   1. associate-*r* 99.7%

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

5. Simplified 99.7%

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

6. Final simplification 99.7%

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

Alternative 3: 99.2% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x eps)
 :precision binary64
 (* eps (+ (cos x) (* eps (+ (* x -0.5) (* eps -0.16666666666666666))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.6%

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

3. Taylor expanded in eps around 0 99.7%

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

4. Taylor expanded in x around 0 99.4%

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

5. Final simplification 99.4%

   \[\leadsto \varepsilon \cdot \left(\cos x + \varepsilon \cdot \left(x \cdot -0.5 + \varepsilon \cdot -0.16666666666666666\right)\right) \]
6. Add Preprocessing

Alternative 4: 99.2% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.6%

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

3. Taylor expanded in eps around 0 99.7%

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

   1. associate-*r* 99.7%

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

5. Simplified 99.7%

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

6. Taylor expanded in x around 0 99.4%

   \[\leadsto \varepsilon \cdot \left(\cos x + \color{blue}{-0.5 \cdot \left(\varepsilon \cdot x\right)}\right) \]
7. Add Preprocessing

Alternative 5: 99.1% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \varepsilon \cdot \cos x \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.6%

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

3. Taylor expanded in eps around 0 99.3%

   \[\leadsto \color{blue}{\varepsilon \cdot \cos x} \]
4. Add Preprocessing

Alternative 6: 98.5% accurate, 18.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.6%

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

3. Taylor expanded in eps around 0 99.7%

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

   1. associate-*r* 99.7%

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

5. Simplified 99.7%

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

6. Taylor expanded in x around 0 99.4%

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

7. Taylor expanded in x around 0 98.9%

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

   1. distribute-lft-out 98.9%

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

9. Simplified 98.9%

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

    1. +-commutative 98.9%

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

    2. distribute-lft-in 98.9%

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

    3. associate-*r* 98.9%

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

    4. associate-*r* 98.9%

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

    5. *-commutative 98.9%

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

    6. *-rgt-identity 98.9%

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

11. Applied egg-rr 98.9%

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

12. Final simplification 98.9%

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

Alternative 7: 98.5% accurate, 18.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x, eps):
	return eps * (1.0 + (x * (-0.5 * (eps + x))))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.6%

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

3. Taylor expanded in eps around 0 99.7%

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

   1. associate-*r* 99.7%

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

5. Simplified 99.7%

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

6. Taylor expanded in x around 0 99.4%

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

7. Taylor expanded in x around 0 98.9%

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

   1. distribute-lft-out 98.9%

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

9. Simplified 98.9%

   \[\leadsto \varepsilon \cdot \color{blue}{\left(1 + x \cdot \left(-0.5 \cdot \left(\varepsilon + x\right)\right)\right)} \]
10. Add Preprocessing

Alternative 8: 98.0% accurate, 22.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x, eps):
	return eps * ((-0.5 * (eps * x)) + 1.0)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.6%

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

3. Taylor expanded in eps around 0 99.7%

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

   1. associate-*r* 99.7%

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

5. Simplified 99.7%

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

6. Taylor expanded in x around 0 98.2%

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

7. Taylor expanded in eps around 0 98.2%

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

8. Final simplification 98.2%

   \[\leadsto \varepsilon \cdot \left(-0.5 \cdot \left(\varepsilon \cdot x\right) + 1\right) \]
9. Add Preprocessing

Alternative 9: 98.0% accurate, 205.0× speedup

Math

\[\begin{array}{l} \\ \varepsilon \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 eps)

C

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

Fortran

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

Java

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

Python

def code(x, eps):
	return eps

Julia

function code(x, eps)
	return eps
end

MATLAB

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

Wolfram

code[x_, eps_] := eps

Derivation

1. Initial program 62.6%

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

3. Taylor expanded in eps around 0 99.3%

   \[\leadsto \color{blue}{\varepsilon \cdot \cos x} \]

4. Taylor expanded in x around 0 98.2%

   \[\leadsto \color{blue}{\varepsilon} \]
5. Add Preprocessing

Developer target: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double eps) {
	return (2.0 * cos((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 * cos((x + (eps / 2.0d0)))) * sin((eps / 2.0d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024085 
(FPCore (x eps)
  :name "2sin (example 3.3)"
  :precision binary64
  :pre (and (and (and (<= -10000.0 x) (<= x 10000.0)) (< (* 1e-16 (fabs x)) eps)) (< eps (fabs x)))

  :alt
  (* (* 2.0 (cos (+ x (/ eps 2.0)))) (sin (/ eps 2.0)))

  (- (sin (+ x eps)) (sin x)))