Hyperbolic sine

Percentage Accurate: 55.3% → 99.7%

Time: 4.3s

Alternatives: 9

Speedup: 1.9×

• 50.3% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \frac{e^{x} - e^{-x}}{2} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (- (exp x) (exp (- x))) 2.0))

C

double code(double x) {
	return (exp(x) - exp(-x)) / 2.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (exp(x) - exp(-x)) / 2.0d0
end function

Java

public static double code(double x) {
	return (Math.exp(x) - Math.exp(-x)) / 2.0;
}

Python

def code(x):
	return (math.exp(x) - math.exp(-x)) / 2.0

Julia

function code(x)
	return Float64(Float64(exp(x) - exp(Float64(-x))) / 2.0)
end

MATLAB

function tmp = code(x)
	tmp = (exp(x) - exp(-x)) / 2.0;
end

Wolfram

code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]

Initial Program: 55.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{x} - e^{-x}}{2} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (- (exp x) (exp (- x))) 2.0))

C

double code(double x) {
	return (exp(x) - exp(-x)) / 2.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (exp(x) - exp(-x)) / 2.0d0
end function

Java

public static double code(double x) {
	return (Math.exp(x) - Math.exp(-x)) / 2.0;
}

Python

def code(x):
	return (math.exp(x) - math.exp(-x)) / 2.0

Julia

function code(x)
	return Float64(Float64(exp(x) - exp(Float64(-x))) / 2.0)
end

MATLAB

function tmp = code(x)
	tmp = (exp(x) - exp(-x)) / 2.0;
end

Wolfram

code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]

Alternative 1: 99.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{x} - e^{-x}\\ \mathbf{if}\;t_0 \leq -\infty \lor \neg \left(t_0 \leq 0.04\right):\\ \;\;\;\;\frac{t_0}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.0003968253968253968 \cdot {x}^{7} + \left(0.016666666666666666 \cdot {x}^{5} + \left(0.3333333333333333 \cdot {x}^{3} + x \cdot 2\right)\right)}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (- (exp x) (exp (- x)))))
   (if (or (<= t_0 (- INFINITY)) (not (<= t_0 0.04)))
     (/ t_0 2.0)
     (/
      (+
       (* 0.0003968253968253968 (pow x 7.0))
       (+
        (* 0.016666666666666666 (pow x 5.0))
        (+ (* 0.3333333333333333 (pow x 3.0)) (* x 2.0))))
      2.0))))

C

double code(double x) {
	double t_0 = exp(x) - exp(-x);
	double tmp;
	if ((t_0 <= -((double) INFINITY)) || !(t_0 <= 0.04)) {
		tmp = t_0 / 2.0;
	} else {
		tmp = ((0.0003968253968253968 * pow(x, 7.0)) + ((0.016666666666666666 * pow(x, 5.0)) + ((0.3333333333333333 * pow(x, 3.0)) + (x * 2.0)))) / 2.0;
	}
	return tmp;
}

Java

public static double code(double x) {
	double t_0 = Math.exp(x) - Math.exp(-x);
	double tmp;
	if ((t_0 <= -Double.POSITIVE_INFINITY) || !(t_0 <= 0.04)) {
		tmp = t_0 / 2.0;
	} else {
		tmp = ((0.0003968253968253968 * Math.pow(x, 7.0)) + ((0.016666666666666666 * Math.pow(x, 5.0)) + ((0.3333333333333333 * Math.pow(x, 3.0)) + (x * 2.0)))) / 2.0;
	}
	return tmp;
}

Python

def code(x):
	t_0 = math.exp(x) - math.exp(-x)
	tmp = 0
	if (t_0 <= -math.inf) or not (t_0 <= 0.04):
		tmp = t_0 / 2.0
	else:
		tmp = ((0.0003968253968253968 * math.pow(x, 7.0)) + ((0.016666666666666666 * math.pow(x, 5.0)) + ((0.3333333333333333 * math.pow(x, 3.0)) + (x * 2.0)))) / 2.0
	return tmp

Julia

function code(x)
	t_0 = Float64(exp(x) - exp(Float64(-x)))
	tmp = 0.0
	if ((t_0 <= Float64(-Inf)) || !(t_0 <= 0.04))
		tmp = Float64(t_0 / 2.0);
	else
		tmp = Float64(Float64(Float64(0.0003968253968253968 * (x ^ 7.0)) + Float64(Float64(0.016666666666666666 * (x ^ 5.0)) + Float64(Float64(0.3333333333333333 * (x ^ 3.0)) + Float64(x * 2.0)))) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	t_0 = exp(x) - exp(-x);
	tmp = 0.0;
	if ((t_0 <= -Inf) || ~((t_0 <= 0.04)))
		tmp = t_0 / 2.0;
	else
		tmp = ((0.0003968253968253968 * (x ^ 7.0)) + ((0.016666666666666666 * (x ^ 5.0)) + ((0.3333333333333333 * (x ^ 3.0)) + (x * 2.0)))) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := Block[{t$95$0 = N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, (-Infinity)], N[Not[LessEqual[t$95$0, 0.04]], $MachinePrecision]], N[(t$95$0 / 2.0), $MachinePrecision], N[(N[(N[(0.0003968253968253968 * N[Power[x, 7.0], $MachinePrecision]), $MachinePrecision] + N[(N[(0.016666666666666666 * N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision] + N[(N[(0.3333333333333333 * N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < -inf.0 or 0.0400000000000000008 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x)))

   1. Initial program 100.0%

      \[\frac{e^{x} - e^{-x}}{2} \]

   if -inf.0 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < 0.0400000000000000008

   1. Initial program 9.3%

      \[\frac{e^{x} - e^{-x}}{2} \]

   2. Taylor expanded in x around 0 100.0%

      \[\leadsto \frac{\color{blue}{0.0003968253968253968 \cdot {x}^{7} + \left(0.016666666666666666 \cdot {x}^{5} + \left(0.3333333333333333 \cdot {x}^{3} + 2 \cdot x\right)\right)}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{x} - e^{-x} \leq -\infty \lor \neg \left(e^{x} - e^{-x} \leq 0.04\right):\\ \;\;\;\;\frac{e^{x} - e^{-x}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.0003968253968253968 \cdot {x}^{7} + \left(0.016666666666666666 \cdot {x}^{5} + \left(0.3333333333333333 \cdot {x}^{3} + x \cdot 2\right)\right)}{2}\\ \end{array} \]

Alternative 2: 99.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{x} - e^{-x}\\ \mathbf{if}\;t_0 \leq -\infty \lor \neg \left(t_0 \leq 0.04\right):\\ \;\;\;\;\frac{t_0}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, 2, 0.016666666666666666 \cdot {x}^{5} + 0.3333333333333333 \cdot {x}^{3}\right)}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (- (exp x) (exp (- x)))))
   (if (or (<= t_0 (- INFINITY)) (not (<= t_0 0.04)))
     (/ t_0 2.0)
     (/
      (fma
       x
       2.0
       (+
        (* 0.016666666666666666 (pow x 5.0))
        (* 0.3333333333333333 (pow x 3.0))))
      2.0))))

C

double code(double x) {
	double t_0 = exp(x) - exp(-x);
	double tmp;
	if ((t_0 <= -((double) INFINITY)) || !(t_0 <= 0.04)) {
		tmp = t_0 / 2.0;
	} else {
		tmp = fma(x, 2.0, ((0.016666666666666666 * pow(x, 5.0)) + (0.3333333333333333 * pow(x, 3.0)))) / 2.0;
	}
	return tmp;
}

Julia

function code(x)
	t_0 = Float64(exp(x) - exp(Float64(-x)))
	tmp = 0.0
	if ((t_0 <= Float64(-Inf)) || !(t_0 <= 0.04))
		tmp = Float64(t_0 / 2.0);
	else
		tmp = Float64(fma(x, 2.0, Float64(Float64(0.016666666666666666 * (x ^ 5.0)) + Float64(0.3333333333333333 * (x ^ 3.0)))) / 2.0);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, (-Infinity)], N[Not[LessEqual[t$95$0, 0.04]], $MachinePrecision]], N[(t$95$0 / 2.0), $MachinePrecision], N[(N[(x * 2.0 + N[(N[(0.016666666666666666 * N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision] + N[(0.3333333333333333 * N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < -inf.0 or 0.0400000000000000008 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x)))

   1. Initial program 100.0%

      \[\frac{e^{x} - e^{-x}}{2} \]

   if -inf.0 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < 0.0400000000000000008

   1. Initial program 9.3%

      \[\frac{e^{x} - e^{-x}}{2} \]

   2. Taylor expanded in x around 0 100.0%

      \[\leadsto \frac{\color{blue}{0.016666666666666666 \cdot {x}^{5} + \left(0.3333333333333333 \cdot {x}^{3} + 2 \cdot x\right)}}{2} \]
   3. Step-by-step derivation

      1. associate-+r+ 100.0%

         \[\leadsto \frac{\color{blue}{\left(0.016666666666666666 \cdot {x}^{5} + 0.3333333333333333 \cdot {x}^{3}\right) + 2 \cdot x}}{2} \]

      2. +-commutative 100.0%

         \[\leadsto \frac{\color{blue}{2 \cdot x + \left(0.016666666666666666 \cdot {x}^{5} + 0.3333333333333333 \cdot {x}^{3}\right)}}{2} \]

      3. *-commutative 100.0%

         \[\leadsto \frac{\color{blue}{x \cdot 2} + \left(0.016666666666666666 \cdot {x}^{5} + 0.3333333333333333 \cdot {x}^{3}\right)}{2} \]

      4. fma-def 100.0%

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(x, 2, 0.016666666666666666 \cdot {x}^{5} + 0.3333333333333333 \cdot {x}^{3}\right)}}{2} \]

      5. +-commutative 100.0%

         \[\leadsto \frac{\mathsf{fma}\left(x, 2, \color{blue}{0.3333333333333333 \cdot {x}^{3} + 0.016666666666666666 \cdot {x}^{5}}\right)}{2} \]

      6. fma-def 100.0%

         \[\leadsto \frac{\mathsf{fma}\left(x, 2, \color{blue}{\mathsf{fma}\left(0.3333333333333333, {x}^{3}, 0.016666666666666666 \cdot {x}^{5}\right)}\right)}{2} \]

   4. Applied egg-rr 100.0%

      \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(x, 2, \mathsf{fma}\left(0.3333333333333333, {x}^{3}, 0.016666666666666666 \cdot {x}^{5}\right)\right)}}{2} \]
   5. Step-by-step derivation

      1. fma-udef 100.0%

         \[\leadsto \frac{\mathsf{fma}\left(x, 2, \color{blue}{0.3333333333333333 \cdot {x}^{3} + 0.016666666666666666 \cdot {x}^{5}}\right)}{2} \]

   6. Applied egg-rr 100.0%

      \[\leadsto \frac{\mathsf{fma}\left(x, 2, \color{blue}{0.3333333333333333 \cdot {x}^{3} + 0.016666666666666666 \cdot {x}^{5}}\right)}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{x} - e^{-x} \leq -\infty \lor \neg \left(e^{x} - e^{-x} \leq 0.04\right):\\ \;\;\;\;\frac{e^{x} - e^{-x}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, 2, 0.016666666666666666 \cdot {x}^{5} + 0.3333333333333333 \cdot {x}^{3}\right)}{2}\\ \end{array} \]

Alternative 3: 99.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{x} - e^{-x}\\ \mathbf{if}\;t_0 \leq -\infty \lor \neg \left(t_0 \leq 0.04\right):\\ \;\;\;\;\frac{t_0}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.016666666666666666 \cdot {x}^{5} + \left(0.3333333333333333 \cdot {x}^{3} + x \cdot 2\right)}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (- (exp x) (exp (- x)))))
   (if (or (<= t_0 (- INFINITY)) (not (<= t_0 0.04)))
     (/ t_0 2.0)
     (/
      (+
       (* 0.016666666666666666 (pow x 5.0))
       (+ (* 0.3333333333333333 (pow x 3.0)) (* x 2.0)))
      2.0))))

C

double code(double x) {
	double t_0 = exp(x) - exp(-x);
	double tmp;
	if ((t_0 <= -((double) INFINITY)) || !(t_0 <= 0.04)) {
		tmp = t_0 / 2.0;
	} else {
		tmp = ((0.016666666666666666 * pow(x, 5.0)) + ((0.3333333333333333 * pow(x, 3.0)) + (x * 2.0))) / 2.0;
	}
	return tmp;
}

Java

public static double code(double x) {
	double t_0 = Math.exp(x) - Math.exp(-x);
	double tmp;
	if ((t_0 <= -Double.POSITIVE_INFINITY) || !(t_0 <= 0.04)) {
		tmp = t_0 / 2.0;
	} else {
		tmp = ((0.016666666666666666 * Math.pow(x, 5.0)) + ((0.3333333333333333 * Math.pow(x, 3.0)) + (x * 2.0))) / 2.0;
	}
	return tmp;
}

Python

def code(x):
	t_0 = math.exp(x) - math.exp(-x)
	tmp = 0
	if (t_0 <= -math.inf) or not (t_0 <= 0.04):
		tmp = t_0 / 2.0
	else:
		tmp = ((0.016666666666666666 * math.pow(x, 5.0)) + ((0.3333333333333333 * math.pow(x, 3.0)) + (x * 2.0))) / 2.0
	return tmp

Julia

function code(x)
	t_0 = Float64(exp(x) - exp(Float64(-x)))
	tmp = 0.0
	if ((t_0 <= Float64(-Inf)) || !(t_0 <= 0.04))
		tmp = Float64(t_0 / 2.0);
	else
		tmp = Float64(Float64(Float64(0.016666666666666666 * (x ^ 5.0)) + Float64(Float64(0.3333333333333333 * (x ^ 3.0)) + Float64(x * 2.0))) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	t_0 = exp(x) - exp(-x);
	tmp = 0.0;
	if ((t_0 <= -Inf) || ~((t_0 <= 0.04)))
		tmp = t_0 / 2.0;
	else
		tmp = ((0.016666666666666666 * (x ^ 5.0)) + ((0.3333333333333333 * (x ^ 3.0)) + (x * 2.0))) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := Block[{t$95$0 = N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, (-Infinity)], N[Not[LessEqual[t$95$0, 0.04]], $MachinePrecision]], N[(t$95$0 / 2.0), $MachinePrecision], N[(N[(N[(0.016666666666666666 * N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision] + N[(N[(0.3333333333333333 * N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < -inf.0 or 0.0400000000000000008 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x)))

   1. Initial program 100.0%

      \[\frac{e^{x} - e^{-x}}{2} \]

   if -inf.0 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < 0.0400000000000000008

   1. Initial program 9.3%

      \[\frac{e^{x} - e^{-x}}{2} \]

   2. Taylor expanded in x around 0 100.0%

      \[\leadsto \frac{\color{blue}{0.016666666666666666 \cdot {x}^{5} + \left(0.3333333333333333 \cdot {x}^{3} + 2 \cdot x\right)}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{x} - e^{-x} \leq -\infty \lor \neg \left(e^{x} - e^{-x} \leq 0.04\right):\\ \;\;\;\;\frac{e^{x} - e^{-x}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.016666666666666666 \cdot {x}^{5} + \left(0.3333333333333333 \cdot {x}^{3} + x \cdot 2\right)}{2}\\ \end{array} \]

Alternative 4: 99.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{x} - e^{-x}\\ \mathbf{if}\;t_0 \leq -\infty \lor \neg \left(t_0 \leq 0.0002\right):\\ \;\;\;\;\frac{t_0}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.3333333333333333 \cdot {x}^{3} + x \cdot 2}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (- (exp x) (exp (- x)))))
   (if (or (<= t_0 (- INFINITY)) (not (<= t_0 0.0002)))
     (/ t_0 2.0)
     (/ (+ (* 0.3333333333333333 (pow x 3.0)) (* x 2.0)) 2.0))))

C

double code(double x) {
	double t_0 = exp(x) - exp(-x);
	double tmp;
	if ((t_0 <= -((double) INFINITY)) || !(t_0 <= 0.0002)) {
		tmp = t_0 / 2.0;
	} else {
		tmp = ((0.3333333333333333 * pow(x, 3.0)) + (x * 2.0)) / 2.0;
	}
	return tmp;
}

Java

public static double code(double x) {
	double t_0 = Math.exp(x) - Math.exp(-x);
	double tmp;
	if ((t_0 <= -Double.POSITIVE_INFINITY) || !(t_0 <= 0.0002)) {
		tmp = t_0 / 2.0;
	} else {
		tmp = ((0.3333333333333333 * Math.pow(x, 3.0)) + (x * 2.0)) / 2.0;
	}
	return tmp;
}

Python

def code(x):
	t_0 = math.exp(x) - math.exp(-x)
	tmp = 0
	if (t_0 <= -math.inf) or not (t_0 <= 0.0002):
		tmp = t_0 / 2.0
	else:
		tmp = ((0.3333333333333333 * math.pow(x, 3.0)) + (x * 2.0)) / 2.0
	return tmp

Julia

function code(x)
	t_0 = Float64(exp(x) - exp(Float64(-x)))
	tmp = 0.0
	if ((t_0 <= Float64(-Inf)) || !(t_0 <= 0.0002))
		tmp = Float64(t_0 / 2.0);
	else
		tmp = Float64(Float64(Float64(0.3333333333333333 * (x ^ 3.0)) + Float64(x * 2.0)) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	t_0 = exp(x) - exp(-x);
	tmp = 0.0;
	if ((t_0 <= -Inf) || ~((t_0 <= 0.0002)))
		tmp = t_0 / 2.0;
	else
		tmp = ((0.3333333333333333 * (x ^ 3.0)) + (x * 2.0)) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := Block[{t$95$0 = N[(N[Exp[x], $MachinePrecision] - N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, (-Infinity)], N[Not[LessEqual[t$95$0, 0.0002]], $MachinePrecision]], N[(t$95$0 / 2.0), $MachinePrecision], N[(N[(N[(0.3333333333333333 * N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < -inf.0 or 2.0000000000000001e-4 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x)))

   1. Initial program 99.9%

      \[\frac{e^{x} - e^{-x}}{2} \]

   if -inf.0 < (-.f64 (exp.f64 x) (exp.f64 (neg.f64 x))) < 2.0000000000000001e-4

   1. Initial program 8.1%

      \[\frac{e^{x} - e^{-x}}{2} \]

   2. Taylor expanded in x around 0 100.0%

      \[\leadsto \frac{\color{blue}{0.3333333333333333 \cdot {x}^{3} + 2 \cdot x}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{x} - e^{-x} \leq -\infty \lor \neg \left(e^{x} - e^{-x} \leq 0.0002\right):\\ \;\;\;\;\frac{e^{x} - e^{-x}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.3333333333333333 \cdot {x}^{3} + x \cdot 2}{2}\\ \end{array} \]

Alternative 5: 89.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.3 \lor \neg \left(x \leq 3.3\right):\\ \;\;\;\;\frac{0.016666666666666666 \cdot {x}^{5}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot 2}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -3.3) (not (<= x 3.3)))
   (/ (* 0.016666666666666666 (pow x 5.0)) 2.0)
   (/ (* x 2.0) 2.0)))

C

double code(double x) {
	double tmp;
	if ((x <= -3.3) || !(x <= 3.3)) {
		tmp = (0.016666666666666666 * pow(x, 5.0)) / 2.0;
	} else {
		tmp = (x * 2.0) / 2.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-3.3d0)) .or. (.not. (x <= 3.3d0))) then
        tmp = (0.016666666666666666d0 * (x ** 5.0d0)) / 2.0d0
    else
        tmp = (x * 2.0d0) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -3.3) || !(x <= 3.3)) {
		tmp = (0.016666666666666666 * Math.pow(x, 5.0)) / 2.0;
	} else {
		tmp = (x * 2.0) / 2.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -3.3) or not (x <= 3.3):
		tmp = (0.016666666666666666 * math.pow(x, 5.0)) / 2.0
	else:
		tmp = (x * 2.0) / 2.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -3.3) || !(x <= 3.3))
		tmp = Float64(Float64(0.016666666666666666 * (x ^ 5.0)) / 2.0);
	else
		tmp = Float64(Float64(x * 2.0) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -3.3) || ~((x <= 3.3)))
		tmp = (0.016666666666666666 * (x ^ 5.0)) / 2.0;
	else
		tmp = (x * 2.0) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -3.3], N[Not[LessEqual[x, 3.3]], $MachinePrecision]], N[(N[(0.016666666666666666 * N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.2999999999999998 or 3.2999999999999998 < x

   1. Initial program 100.0%

      \[\frac{e^{x} - e^{-x}}{2} \]

   2. Taylor expanded in x around 0 80.6%

      \[\leadsto \frac{\color{blue}{0.016666666666666666 \cdot {x}^{5} + \left(0.3333333333333333 \cdot {x}^{3} + 2 \cdot x\right)}}{2} \]

   3. Taylor expanded in x around inf 80.6%

      \[\leadsto \frac{\color{blue}{0.016666666666666666 \cdot {x}^{5}}}{2} \]

   if -3.2999999999999998 < x < 3.2999999999999998

   1. Initial program 9.3%

      \[\frac{e^{x} - e^{-x}}{2} \]

   2. Taylor expanded in x around 0 98.7%

      \[\leadsto \frac{\color{blue}{2 \cdot x}}{2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.3 \lor \neg \left(x \leq 3.3\right):\\ \;\;\;\;\frac{0.016666666666666666 \cdot {x}^{5}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot 2}{2}\\ \end{array} \]

Alternative 6: 92.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \frac{0.0003968253968253968 \cdot {x}^{7} + x \cdot 2}{2} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/ (+ (* 0.0003968253968253968 (pow x 7.0)) (* x 2.0)) 2.0))

C

double code(double x) {
	return ((0.0003968253968253968 * pow(x, 7.0)) + (x * 2.0)) / 2.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = ((0.0003968253968253968d0 * (x ** 7.0d0)) + (x * 2.0d0)) / 2.0d0
end function

Java

public static double code(double x) {
	return ((0.0003968253968253968 * Math.pow(x, 7.0)) + (x * 2.0)) / 2.0;
}

Python

def code(x):
	return ((0.0003968253968253968 * math.pow(x, 7.0)) + (x * 2.0)) / 2.0

Julia

function code(x)
	return Float64(Float64(Float64(0.0003968253968253968 * (x ^ 7.0)) + Float64(x * 2.0)) / 2.0)
end

MATLAB

function tmp = code(x)
	tmp = ((0.0003968253968253968 * (x ^ 7.0)) + (x * 2.0)) / 2.0;
end

Wolfram

code[x_] := N[(N[(N[(0.0003968253968253968 * N[Power[x, 7.0], $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]

Derivation

1. Initial program 52.5%

   \[\frac{e^{x} - e^{-x}}{2} \]

2. Taylor expanded in x around 0 94.1%

   \[\leadsto \frac{\color{blue}{0.0003968253968253968 \cdot {x}^{7} + \left(0.016666666666666666 \cdot {x}^{5} + \left(0.3333333333333333 \cdot {x}^{3} + 2 \cdot x\right)\right)}}{2} \]

3. Taylor expanded in x around 0 93.4%

   \[\leadsto \frac{0.0003968253968253968 \cdot {x}^{7} + \color{blue}{2 \cdot x}}{2} \]

4. Final simplification 93.4%

   \[\leadsto \frac{0.0003968253968253968 \cdot {x}^{7} + x \cdot 2}{2} \]

Alternative 7: 51.3% accurate, 41.2× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot 2}{2} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (* x 2.0) 2.0))

C

double code(double x) {
	return (x * 2.0) / 2.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (x * 2.0d0) / 2.0d0
end function

Java

public static double code(double x) {
	return (x * 2.0) / 2.0;
}

Python

def code(x):
	return (x * 2.0) / 2.0

Julia

function code(x)
	return Float64(Float64(x * 2.0) / 2.0)
end

MATLAB

function tmp = code(x)
	tmp = (x * 2.0) / 2.0;
end

Wolfram

code[x_] := N[(N[(x * 2.0), $MachinePrecision] / 2.0), $MachinePrecision]

Derivation

1. Initial program 52.5%

   \[\frac{e^{x} - e^{-x}}{2} \]

2. Taylor expanded in x around 0 54.1%

   \[\leadsto \frac{\color{blue}{2 \cdot x}}{2} \]

3. Final simplification 54.1%

   \[\leadsto \frac{x \cdot 2}{2} \]

Alternative 8: 2.9% accurate, 206.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (x) :precision binary64 -1.0)

C

double code(double x) {
	return -1.0;
}

Fortran

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

Java

public static double code(double x) {
	return -1.0;
}

Python

def code(x):
	return -1.0

Julia

function code(x)
	return -1.0
end

MATLAB

function tmp = code(x)
	tmp = -1.0;
end

Wolfram

code[x_] := -1.0

Derivation

1. Initial program 52.5%

   \[\frac{e^{x} - e^{-x}}{2} \]

3. Applied egg-rr 2.9%

   \[\leadsto \frac{\color{blue}{-2}}{2} \]

4. Final simplification 2.9%

   \[\leadsto -1 \]

Alternative 9: 3.4% accurate, 206.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 0.0)

C

double code(double x) {
	return 0.0;
}

Fortran

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

Java

public static double code(double x) {
	return 0.0;
}

Python

def code(x):
	return 0.0

Julia

function code(x)
	return 0.0
end

MATLAB

function tmp = code(x)
	tmp = 0.0;
end

Wolfram

code[x_] := 0.0

Derivation

1. Initial program 52.5%

   \[\frac{e^{x} - e^{-x}}{2} \]

3. Applied egg-rr 3.5%

   \[\leadsto \frac{\color{blue}{0}}{2} \]

4. Final simplification 3.5%

   \[\leadsto 0 \]

Reproduce

herbie shell --seed 2023308 
(FPCore (x)
  :name "Hyperbolic sine"
  :precision binary64
  (/ (- (exp x) (exp (- x))) 2.0))