Hyperbolic secant

Percentage Accurate: 100.0% → 99.3%
Time: 2.0s
Alternatives: 4
Speedup: 1.0×

Specification

?
\[\begin{array}{l} \\ \frac{2}{e^{x} + e^{-x}} \end{array} \]
(FPCore (x) :precision binary64 (/ 2.0 (+ (exp x) (exp (- x)))))
double code(double x) {
	return 2.0 / (exp(x) + exp(-x));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = 2.0d0 / (exp(x) + exp(-x))
end function
public static double code(double x) {
	return 2.0 / (Math.exp(x) + Math.exp(-x));
}
def code(x):
	return 2.0 / (math.exp(x) + math.exp(-x))
function code(x)
	return Float64(2.0 / Float64(exp(x) + exp(Float64(-x))))
end
function tmp = code(x)
	tmp = 2.0 / (exp(x) + exp(-x));
end
code[x_] := N[(2.0 / N[(N[Exp[x], $MachinePrecision] + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{2}{e^{x} + e^{-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 4 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: 100.0% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{2}{e^{x} + e^{-x}} \end{array} \]
(FPCore (x) :precision binary64 (/ 2.0 (+ (exp x) (exp (- x)))))
double code(double x) {
	return 2.0 / (exp(x) + exp(-x));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = 2.0d0 / (exp(x) + exp(-x))
end function
public static double code(double x) {
	return 2.0 / (Math.exp(x) + Math.exp(-x));
}
def code(x):
	return 2.0 / (math.exp(x) + math.exp(-x))
function code(x)
	return Float64(2.0 / Float64(exp(x) + exp(Float64(-x))))
end
function tmp = code(x)
	tmp = 2.0 / (exp(x) + exp(-x));
end
code[x_] := N[(2.0 / N[(N[Exp[x], $MachinePrecision] + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{2}{e^{x} + e^{-x}}
\end{array}

Alternative 1: 99.3% accurate, 17.1× speedup?

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 1.4:\\ \;\;\;\;1 + -0.5 \cdot \left(x\_m \cdot x\_m\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]
x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 1.4) (+ 1.0 (* -0.5 (* x_m x_m))) 0.0))
x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = 1.0 + (-0.5 * (x_m * x_m));
	} else {
		tmp = 0.0;
	}
	return tmp;
}
x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    real(8) :: tmp
    if (x_m <= 1.4d0) then
        tmp = 1.0d0 + ((-0.5d0) * (x_m * x_m))
    else
        tmp = 0.0d0
    end if
    code = tmp
end function
x_m = Math.abs(x);
public static double code(double x_m) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = 1.0 + (-0.5 * (x_m * x_m));
	} else {
		tmp = 0.0;
	}
	return tmp;
}
x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 1.4:
		tmp = 1.0 + (-0.5 * (x_m * x_m))
	else:
		tmp = 0.0
	return tmp
x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 1.4)
		tmp = Float64(1.0 + Float64(-0.5 * Float64(x_m * x_m)));
	else
		tmp = 0.0;
	end
	return tmp
end
x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 1.4)
		tmp = 1.0 + (-0.5 * (x_m * x_m));
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 1.4], N[(1.0 + N[(-0.5 * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0]
\begin{array}{l}
x_m = \left|x\right|

\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 1.4:\\
\;\;\;\;1 + -0.5 \cdot \left(x\_m \cdot x\_m\right)\\

\mathbf{else}:\\
\;\;\;\;0\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if x < 1.3999999999999999

    1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]
    2. Add Preprocessing
    3. Taylor expanded in x around 0 63.7%

      \[\leadsto \color{blue}{1 + -0.5 \cdot {x}^{2}} \]
    4. Step-by-step derivation
      1. unpow263.7%

        \[\leadsto 1 + -0.5 \cdot \color{blue}{\left(x \cdot x\right)} \]
    5. Applied egg-rr63.7%

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

    if 1.3999999999999999 < x

    1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]
    2. Add Preprocessing
    3. Applied egg-rr100.0%

      \[\leadsto \color{blue}{0} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification72.8%

    \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.4:\\ \;\;\;\;1 + -0.5 \cdot \left(x \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
  5. Add Preprocessing

Alternative 2: 100.0% accurate, 1.0× speedup?

\[\begin{array}{l} x_m = \left|x\right| \\ \frac{2}{e^{x\_m} + e^{-x\_m}} \end{array} \]
x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (/ 2.0 (+ (exp x_m) (exp (- x_m)))))
x_m = fabs(x);
double code(double x_m) {
	return 2.0 / (exp(x_m) + exp(-x_m));
}
x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    code = 2.0d0 / (exp(x_m) + exp(-x_m))
end function
x_m = Math.abs(x);
public static double code(double x_m) {
	return 2.0 / (Math.exp(x_m) + Math.exp(-x_m));
}
x_m = math.fabs(x)
def code(x_m):
	return 2.0 / (math.exp(x_m) + math.exp(-x_m))
x_m = abs(x)
function code(x_m)
	return Float64(2.0 / Float64(exp(x_m) + exp(Float64(-x_m))))
end
x_m = abs(x);
function tmp = code(x_m)
	tmp = 2.0 / (exp(x_m) + exp(-x_m));
end
x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := N[(2.0 / N[(N[Exp[x$95$m], $MachinePrecision] + N[Exp[(-x$95$m)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|

\\
\frac{2}{e^{x\_m} + e^{-x\_m}}
\end{array}
Derivation
  1. Initial program 100.0%

    \[\frac{2}{e^{x} + e^{-x}} \]
  2. Add Preprocessing
  3. Final simplification100.0%

    \[\leadsto \frac{2}{e^{x} + e^{-x}} \]
  4. Add Preprocessing

Alternative 3: 99.0% accurate, 34.2× speedup?

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 350:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]
x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (if (<= x_m 350.0) 1.0 0.0))
x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 350.0) {
		tmp = 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}
x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    real(8) :: tmp
    if (x_m <= 350.0d0) then
        tmp = 1.0d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function
x_m = Math.abs(x);
public static double code(double x_m) {
	double tmp;
	if (x_m <= 350.0) {
		tmp = 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}
x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 350.0:
		tmp = 1.0
	else:
		tmp = 0.0
	return tmp
x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 350.0)
		tmp = 1.0;
	else
		tmp = 0.0;
	end
	return tmp
end
x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 350.0)
		tmp = 1.0;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 350.0], 1.0, 0.0]
\begin{array}{l}
x_m = \left|x\right|

\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 350:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;0\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if x < 350

    1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]
    2. Add Preprocessing
    3. Taylor expanded in x around 0 64.1%

      \[\leadsto \color{blue}{1} \]

    if 350 < x

    1. Initial program 100.0%

      \[\frac{2}{e^{x} + e^{-x}} \]
    2. Add Preprocessing
    3. Applied egg-rr100.0%

      \[\leadsto \color{blue}{0} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification73.1%

    \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 350:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
  5. Add Preprocessing

Alternative 4: 50.6% accurate, 206.0× speedup?

\[\begin{array}{l} x_m = \left|x\right| \\ 0 \end{array} \]
x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 0.0)
x_m = fabs(x);
double code(double x_m) {
	return 0.0;
}
x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    code = 0.0d0
end function
x_m = Math.abs(x);
public static double code(double x_m) {
	return 0.0;
}
x_m = math.fabs(x)
def code(x_m):
	return 0.0
x_m = abs(x)
function code(x_m)
	return 0.0
end
x_m = abs(x);
function tmp = code(x_m)
	tmp = 0.0;
end
x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := 0.0
\begin{array}{l}
x_m = \left|x\right|

\\
0
\end{array}
Derivation
  1. Initial program 100.0%

    \[\frac{2}{e^{x} + e^{-x}} \]
  2. Add Preprocessing
  3. Applied egg-rr54.2%

    \[\leadsto \color{blue}{0} \]
  4. Final simplification54.2%

    \[\leadsto 0 \]
  5. Add Preprocessing

Reproduce

?
herbie shell --seed 2024030 
(FPCore (x)
  :name "Hyperbolic secant"
  :precision binary64
  (/ 2.0 (+ (exp x) (exp (- x)))))