2sin (example 3.3)

Percentage Accurate: 42.6% → 99.7%
Time: 10.6s
Alternatives: 7
Speedup: 2.0×

Specification

?
\[\begin{array}{l} \\ \sin \left(x + \varepsilon\right) - \sin x \end{array} \]
(FPCore (x eps) :precision binary64 (- (sin (+ x eps)) (sin x)))
double code(double x, double eps) {
	return sin((x + eps)) - sin(x);
}

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

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

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

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

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

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

\begin{array}{l}

\\
\sin \left(x + \varepsilon\right) - \sin x
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 7 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 42.6% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \sin \left(x + \varepsilon\right) - \sin x \end{array} \]
(FPCore (x eps) :precision binary64 (- (sin (+ x eps)) (sin x)))
double code(double x, double eps) {
	return sin((x + eps)) - sin(x);
}

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

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

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

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

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

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

\begin{array}{l}

\\
\sin \left(x + \varepsilon\right) - \sin x
\end{array}

Alternative 1: 99.7% accurate, 0.4× speedup?

\[\begin{array}{l} \\ \sin \varepsilon \cdot \cos x - \sin x \cdot \left(\sin \varepsilon \cdot \tan \left(\frac{\varepsilon}{2}\right)\right) \end{array} \]
(FPCore (x eps)
 :precision binary64
 (- (* (sin eps) (cos x)) (* (sin x) (* (sin eps) (tan (/ eps 2.0))))))
double code(double x, double eps) {
	return (sin(eps) * cos(x)) - (sin(x) * (sin(eps) * tan((eps / 2.0))));
}

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = (sin(eps) * cos(x)) - (sin(x) * (sin(eps) * tan((eps / 2.0d0))))
end function

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

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

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

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

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

\begin{array}{l}

\\
\sin \varepsilon \cdot \cos x - \sin x \cdot \left(\sin \varepsilon \cdot \tan \left(\frac{\varepsilon}{2}\right)\right)
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 2: 99.4% accurate, 0.4× speedup?

\[\begin{array}{l} \\ \mathsf{fma}\left(\cos x, \sin \varepsilon, \sin x \cdot \left(\cos \varepsilon + -1\right)\right) \end{array} \]
(FPCore (x eps)
 :precision binary64
 (fma (cos x) (sin eps) (* (sin x) (+ (cos eps) -1.0))))
double code(double x, double eps) {
	return fma(cos(x), sin(eps), (sin(x) * (cos(eps) + -1.0)));
}

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

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

\begin{array}{l}

\\
\mathsf{fma}\left(\cos x, \sin \varepsilon, \sin x \cdot \left(\cos \varepsilon + -1\right)\right)
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 3: 99.4% accurate, 0.5× speedup?

\[\begin{array}{l} \\ \sin \varepsilon \cdot \cos x + \sin x \cdot \left(\cos \varepsilon + -1\right) \end{array} \]
(FPCore (x eps)
 :precision binary64
 (+ (* (sin eps) (cos x)) (* (sin x) (+ (cos eps) -1.0))))
double code(double x, double eps) {
	return (sin(eps) * cos(x)) + (sin(x) * (cos(eps) + -1.0));
}

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

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

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

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

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

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

\begin{array}{l}

\\
\sin \varepsilon \cdot \cos x + \sin x \cdot \left(\cos \varepsilon + -1\right)
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 4: 77.8% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \sin \varepsilon \cdot \cos x \end{array} \]
(FPCore (x eps) :precision binary64 (* (sin eps) (cos x)))
double code(double x, double eps) {
	return sin(eps) * cos(x);
}

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

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

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

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

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

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

\begin{array}{l}

\\
\sin \varepsilon \cdot \cos x
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 5: 75.6% accurate, 1.9× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\varepsilon \leq -0.00125 \lor \neg \left(\varepsilon \leq 1.68 \cdot 10^{+19}\right):\\ \;\;\;\;\sin \varepsilon\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \cos x\\ \end{array} \end{array} \]
(FPCore (x eps)
 :precision binary64
 (if (or (<= eps -0.00125) (not (<= eps 1.68e+19))) (sin eps) (* eps (cos x))))
double code(double x, double eps) {
	double tmp;
	if ((eps <= -0.00125) || !(eps <= 1.68e+19)) {
		tmp = sin(eps);
	} else {
		tmp = eps * cos(x);
	}
	return tmp;
}

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if ((eps <= (-0.00125d0)) .or. (.not. (eps <= 1.68d+19))) then
        tmp = sin(eps)
    else
        tmp = eps * cos(x)
    end if
    code = tmp
end function

public static double code(double x, double eps) {
	double tmp;
	if ((eps <= -0.00125) || !(eps <= 1.68e+19)) {
		tmp = Math.sin(eps);
	} else {
		tmp = eps * Math.cos(x);
	}
	return tmp;
}

def code(x, eps):
	tmp = 0
	if (eps <= -0.00125) or not (eps <= 1.68e+19):
		tmp = math.sin(eps)
	else:
		tmp = eps * math.cos(x)
	return tmp

function code(x, eps)
	tmp = 0.0
	if ((eps <= -0.00125) || !(eps <= 1.68e+19))
		tmp = sin(eps);
	else
		tmp = Float64(eps * cos(x));
	end
	return tmp
end

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((eps <= -0.00125) || ~((eps <= 1.68e+19)))
		tmp = sin(eps);
	else
		tmp = eps * cos(x);
	end
	tmp_2 = tmp;
end

code[x_, eps_] := If[Or[LessEqual[eps, -0.00125], N[Not[LessEqual[eps, 1.68e+19]], $MachinePrecision]], N[Sin[eps], $MachinePrecision], N[(eps * N[Cos[x], $MachinePrecision]), $MachinePrecision]]

\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;\varepsilon \leq -0.00125 \lor \neg \left(\varepsilon \leq 1.68 \cdot 10^{+19}\right):\\
\;\;\;\;\sin \varepsilon\\

\mathbf{else}:\\
\;\;\;\;\varepsilon \cdot \cos x\\


\end{array}
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 6: 54.6% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \sin \varepsilon \end{array} \]
(FPCore (x eps) :precision binary64 (sin eps))
double code(double x, double eps) {
	return sin(eps);
}

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

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

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

function code(x, eps)
	return sin(eps)
end

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

code[x_, eps_] := N[Sin[eps], $MachinePrecision]

\begin{array}{l}

\\
\sin \varepsilon
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Alternative 7: 28.6% accurate, 205.0× speedup?

\[\begin{array}{l} \\ \varepsilon \end{array} \]
(FPCore (x eps) :precision binary64 eps)
double code(double x, double eps) {
	return eps;
}

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

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

def code(x, eps):
	return eps

function code(x, eps)
	return eps
end

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

code[x_, eps_] := eps

\begin{array}{l}

\\
\varepsilon
\end{array}
Derivation
    &prev;&pcontext;&pcontext2;&ctx;
  1. Add Preprocessing

Developer target: 99.4% accurate, 0.4× speedup?

\[\begin{array}{l} \\ \mathsf{fma}\left(\sin x, \cos \varepsilon - 1, \sin \varepsilon \cdot \cos x\right) \end{array} \]
(FPCore (x eps)
 :precision binary64
 (fma (sin x) (- (cos eps) 1.0) (* (sin eps) (cos x))))
double code(double x, double eps) {
	return fma(sin(x), (cos(eps) - 1.0), (sin(eps) * cos(x)));
}

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

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

\begin{array}{l}

\\
\mathsf{fma}\left(\sin x, \cos \varepsilon - 1, \sin \varepsilon \cdot \cos x\right)
\end{array}

Reproduce

?
herbie shell --seed 2023348 
(FPCore (x eps)
  :name "2sin (example 3.3)"
  :precision binary64

  :herbie-target
  (fma (sin x) (- (cos eps) 1.0) (* (sin eps) (cos x)))

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