
(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:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(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}
(FPCore (x) :precision binary64 (let* ((t_0 (exp (- x)))) (/ 2.0 (+ t_0 (/ 1.0 t_0)))))
double code(double x) {
double t_0 = exp(-x);
return 2.0 / (t_0 + (1.0 / t_0));
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: t_0
t_0 = exp(-x)
code = 2.0d0 / (t_0 + (1.0d0 / t_0))
end function
public static double code(double x) {
double t_0 = Math.exp(-x);
return 2.0 / (t_0 + (1.0 / t_0));
}
def code(x): t_0 = math.exp(-x) return 2.0 / (t_0 + (1.0 / t_0))
function code(x) t_0 = exp(Float64(-x)) return Float64(2.0 / Float64(t_0 + Float64(1.0 / t_0))) end
function tmp = code(x) t_0 = exp(-x); tmp = 2.0 / (t_0 + (1.0 / t_0)); end
code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, N[(2.0 / N[(t$95$0 + N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{-x}\\
\frac{2}{t\_0 + \frac{1}{t\_0}}
\end{array}
\end{array}
Initial program 100.0%
/-rgt-identityN/A
clear-numN/A
exp-negN/A
/-lowering-/.f64N/A
exp-lowering-exp.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Final simplification100.0%
(FPCore (x)
:precision binary64
(if (<= (/ 2.0 (+ (exp (- x)) (exp x))) 1e-270)
(/ 720.0 (* x (* x (* x (* x (* x x))))))
(fma
(* x x)
(fma (* x x) (fma x (* x -0.08333333333333333) 0.20833333333333334) -0.5)
1.0)))
double code(double x) {
double tmp;
if ((2.0 / (exp(-x) + exp(x))) <= 1e-270) {
tmp = 720.0 / (x * (x * (x * (x * (x * x)))));
} else {
tmp = fma((x * x), fma((x * x), fma(x, (x * -0.08333333333333333), 0.20833333333333334), -0.5), 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(2.0 / Float64(exp(Float64(-x)) + exp(x))) <= 1e-270) tmp = Float64(720.0 / Float64(x * Float64(x * Float64(x * Float64(x * Float64(x * x)))))); else tmp = fma(Float64(x * x), fma(Float64(x * x), fma(x, Float64(x * -0.08333333333333333), 0.20833333333333334), -0.5), 1.0); end return tmp end
code[x_] := If[LessEqual[N[(2.0 / N[(N[Exp[(-x)], $MachinePrecision] + N[Exp[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-270], N[(720.0 / N[(x * N[(x * N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * x), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * -0.08333333333333333), $MachinePrecision] + 0.20833333333333334), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{2}{e^{-x} + e^{x}} \leq 10^{-270}:\\
\;\;\;\;\frac{720}{x \cdot \left(x \cdot \left(x \cdot \left(x \cdot \left(x \cdot x\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot -0.08333333333333333, 0.20833333333333334\right), -0.5\right), 1\right)\\
\end{array}
\end{array}
if (/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x)))) < 1e-270Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Simplified82.9%
Taylor expanded in x around inf
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
unpow2N/A
cube-multN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6482.9
Simplified82.9%
Taylor expanded in x around inf
/-lowering-/.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6483.6
Simplified83.6%
if 1e-270 < (/.f64 #s(literal 2 binary64) (+.f64 (exp.f64 x) (exp.f64 (neg.f64 x)))) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6498.9
Simplified98.9%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f6499.0
Simplified99.0%
Final simplification91.7%
(FPCore (x)
:precision binary64
(let* ((t_0 (* x (* x x))) (t_1 (* (* x x) (* x x))))
(if (<= x 4e+51)
(*
(/ 2.0 (fma t_1 (* (* t_1 t_1) 7.71604938271605e-6) -4.0))
(fma x (* x (* x (* 0.002777777777777778 t_0))) -2.0))
(/ 720.0 (* x (* x (* x t_0)))))))
double code(double x) {
double t_0 = x * (x * x);
double t_1 = (x * x) * (x * x);
double tmp;
if (x <= 4e+51) {
tmp = (2.0 / fma(t_1, ((t_1 * t_1) * 7.71604938271605e-6), -4.0)) * fma(x, (x * (x * (0.002777777777777778 * t_0))), -2.0);
} else {
tmp = 720.0 / (x * (x * (x * t_0)));
}
return tmp;
}
function code(x) t_0 = Float64(x * Float64(x * x)) t_1 = Float64(Float64(x * x) * Float64(x * x)) tmp = 0.0 if (x <= 4e+51) tmp = Float64(Float64(2.0 / fma(t_1, Float64(Float64(t_1 * t_1) * 7.71604938271605e-6), -4.0)) * fma(x, Float64(x * Float64(x * Float64(0.002777777777777778 * t_0))), -2.0)); else tmp = Float64(720.0 / Float64(x * Float64(x * Float64(x * t_0)))); end return tmp end
code[x_] := Block[{t$95$0 = N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x * x), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 4e+51], N[(N[(2.0 / N[(t$95$1 * N[(N[(t$95$1 * t$95$1), $MachinePrecision] * 7.71604938271605e-6), $MachinePrecision] + -4.0), $MachinePrecision]), $MachinePrecision] * N[(x * N[(x * N[(x * N[(0.002777777777777778 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -2.0), $MachinePrecision]), $MachinePrecision], N[(720.0 / N[(x * N[(x * N[(x * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := x \cdot \left(x \cdot x\right)\\
t_1 := \left(x \cdot x\right) \cdot \left(x \cdot x\right)\\
\mathbf{if}\;x \leq 4 \cdot 10^{+51}:\\
\;\;\;\;\frac{2}{\mathsf{fma}\left(t\_1, \left(t\_1 \cdot t\_1\right) \cdot 7.71604938271605 \cdot 10^{-6}, -4\right)} \cdot \mathsf{fma}\left(x, x \cdot \left(x \cdot \left(0.002777777777777778 \cdot t\_0\right)\right), -2\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{720}{x \cdot \left(x \cdot \left(x \cdot t\_0\right)\right)}\\
\end{array}
\end{array}
if x < 4e51Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Simplified90.2%
Taylor expanded in x around inf
metadata-evalN/A
pow-plusN/A
associate-*l*N/A
metadata-evalN/A
pow-plusN/A
associate-*l*N/A
unpow3N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow3N/A
*-lowering-*.f64N/A
unpow3N/A
unpow2N/A
Simplified89.1%
flip-+N/A
associate-/r/N/A
*-lowering-*.f64N/A
Applied egg-rr70.1%
if 4e51 < x Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Simplified98.2%
Taylor expanded in x around inf
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
unpow2N/A
cube-multN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6498.2
Simplified98.2%
Taylor expanded in x around inf
/-lowering-/.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
(FPCore (x) :precision binary64 (/ 1.0 (cosh x)))
double code(double x) {
return 1.0 / cosh(x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0 / cosh(x)
end function
public static double code(double x) {
return 1.0 / Math.cosh(x);
}
def code(x): return 1.0 / math.cosh(x)
function code(x) return Float64(1.0 / cosh(x)) end
function tmp = code(x) tmp = 1.0 / cosh(x); end
code[x_] := N[(1.0 / N[Cosh[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\cosh x}
\end{array}
Initial program 100.0%
clear-numN/A
cosh-defN/A
/-lowering-/.f64N/A
cosh-lowering-cosh.f64100.0
Applied egg-rr100.0%
(FPCore (x)
:precision binary64
(let* ((t_0 (fma x (* (* x x) 0.08333333333333333) x)) (t_1 (* x t_0)))
(if (<= x 2e+77)
(* (/ 2.0 (fma t_1 t_1 -4.0)) (fma x t_0 -2.0))
(/ 24.0 (* x (* x (* x x)))))))
double code(double x) {
double t_0 = fma(x, ((x * x) * 0.08333333333333333), x);
double t_1 = x * t_0;
double tmp;
if (x <= 2e+77) {
tmp = (2.0 / fma(t_1, t_1, -4.0)) * fma(x, t_0, -2.0);
} else {
tmp = 24.0 / (x * (x * (x * x)));
}
return tmp;
}
function code(x) t_0 = fma(x, Float64(Float64(x * x) * 0.08333333333333333), x) t_1 = Float64(x * t_0) tmp = 0.0 if (x <= 2e+77) tmp = Float64(Float64(2.0 / fma(t_1, t_1, -4.0)) * fma(x, t_0, -2.0)); else tmp = Float64(24.0 / Float64(x * Float64(x * Float64(x * x)))); end return tmp end
code[x_] := Block[{t$95$0 = N[(x * N[(N[(x * x), $MachinePrecision] * 0.08333333333333333), $MachinePrecision] + x), $MachinePrecision]}, Block[{t$95$1 = N[(x * t$95$0), $MachinePrecision]}, If[LessEqual[x, 2e+77], N[(N[(2.0 / N[(t$95$1 * t$95$1 + -4.0), $MachinePrecision]), $MachinePrecision] * N[(x * t$95$0 + -2.0), $MachinePrecision]), $MachinePrecision], N[(24.0 / N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(x, \left(x \cdot x\right) \cdot 0.08333333333333333, x\right)\\
t_1 := x \cdot t\_0\\
\mathbf{if}\;x \leq 2 \cdot 10^{+77}:\\
\;\;\;\;\frac{2}{\mathsf{fma}\left(t\_1, t\_1, -4\right)} \cdot \mathsf{fma}\left(x, t\_0, -2\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{24}{x \cdot \left(x \cdot \left(x \cdot x\right)\right)}\\
\end{array}
\end{array}
if x < 1.99999999999999997e77Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6484.4
Simplified84.4%
flip-+N/A
associate-/r/N/A
*-lowering-*.f64N/A
Applied egg-rr72.1%
if 1.99999999999999997e77 < x Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in x around inf
/-lowering-/.f64N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
unpow2N/A
cube-multN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64100.0
Simplified100.0%
(FPCore (x) :precision binary64 (/ 2.0 (fma x (fma (* x x) (* x (fma x (* x 0.002777777777777778) 0.08333333333333333)) x) 2.0)))
double code(double x) {
return 2.0 / fma(x, fma((x * x), (x * fma(x, (x * 0.002777777777777778), 0.08333333333333333)), x), 2.0);
}
function code(x) return Float64(2.0 / fma(x, fma(Float64(x * x), Float64(x * fma(x, Float64(x * 0.002777777777777778), 0.08333333333333333)), x), 2.0)) end
code[x_] := N[(2.0 / N[(x * N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * N[(x * 0.002777777777777778), $MachinePrecision] + 0.08333333333333333), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\mathsf{fma}\left(x, \mathsf{fma}\left(x \cdot x, x \cdot \mathsf{fma}\left(x, x \cdot 0.002777777777777778, 0.08333333333333333\right), x\right), 2\right)}
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Simplified91.6%
(FPCore (x) :precision binary64 (/ 2.0 (fma x (fma (* x x) (* x (* (* x x) 0.002777777777777778)) x) 2.0)))
double code(double x) {
return 2.0 / fma(x, fma((x * x), (x * ((x * x) * 0.002777777777777778)), x), 2.0);
}
function code(x) return Float64(2.0 / fma(x, fma(Float64(x * x), Float64(x * Float64(Float64(x * x) * 0.002777777777777778)), x), 2.0)) end
code[x_] := N[(2.0 / N[(x * N[(N[(x * x), $MachinePrecision] * N[(x * N[(N[(x * x), $MachinePrecision] * 0.002777777777777778), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\mathsf{fma}\left(x, \mathsf{fma}\left(x \cdot x, x \cdot \left(\left(x \cdot x\right) \cdot 0.002777777777777778\right), x\right), 2\right)}
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Simplified91.6%
Taylor expanded in x around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6491.1
Simplified91.1%
(FPCore (x) :precision binary64 (/ 2.0 (fma x (* 0.002777777777777778 (* x (* x (* x (* x x))))) 2.0)))
double code(double x) {
return 2.0 / fma(x, (0.002777777777777778 * (x * (x * (x * (x * x))))), 2.0);
}
function code(x) return Float64(2.0 / fma(x, Float64(0.002777777777777778 * Float64(x * Float64(x * Float64(x * Float64(x * x))))), 2.0)) end
code[x_] := N[(2.0 / N[(x * N[(0.002777777777777778 * N[(x * N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\mathsf{fma}\left(x, 0.002777777777777778 \cdot \left(x \cdot \left(x \cdot \left(x \cdot \left(x \cdot x\right)\right)\right)\right), 2\right)}
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
Simplified91.6%
Taylor expanded in x around inf
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
unpow2N/A
cube-multN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6462.6
Simplified62.6%
Taylor expanded in x around inf
Simplified90.7%
Final simplification90.7%
(FPCore (x) :precision binary64 (if (<= x 1.4) (fma x (* x (fma (* x x) 0.20833333333333334 -0.5)) 1.0) (/ 2.0 (* x (fma x (* x (* x 0.08333333333333333)) x)))))
double code(double x) {
double tmp;
if (x <= 1.4) {
tmp = fma(x, (x * fma((x * x), 0.20833333333333334, -0.5)), 1.0);
} else {
tmp = 2.0 / (x * fma(x, (x * (x * 0.08333333333333333)), x));
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= 1.4) tmp = fma(x, Float64(x * fma(Float64(x * x), 0.20833333333333334, -0.5)), 1.0); else tmp = Float64(2.0 / Float64(x * fma(x, Float64(x * Float64(x * 0.08333333333333333)), x))); end return tmp end
code[x_] := If[LessEqual[x, 1.4], N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.20833333333333334 + -0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], N[(2.0 / N[(x * N[(x * N[(x * N[(x * 0.08333333333333333), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 1.4:\\
\;\;\;\;\mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x \cdot x, 0.20833333333333334, -0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{x \cdot \mathsf{fma}\left(x, x \cdot \left(x \cdot 0.08333333333333333\right), x\right)}\\
\end{array}
\end{array}
if x < 1.3999999999999999Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6466.7
Simplified66.7%
if 1.3999999999999999 < x Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6478.5
Simplified78.5%
distribute-rgt-inN/A
associate-+l+N/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f6478.5
Applied egg-rr78.5%
Taylor expanded in x around inf
distribute-lft-inN/A
*-commutativeN/A
associate-*r/N/A
*-rgt-identityN/A
metadata-evalN/A
pow-sqrN/A
associate-/l*N/A
*-rgt-identityN/A
associate-*r/N/A
rgt-mult-inverseN/A
*-rgt-identityN/A
metadata-evalN/A
pow-sqrN/A
associate-*l*N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
Simplified78.5%
(FPCore (x) :precision binary64 (/ 2.0 (fma x (fma x (* (* x x) 0.08333333333333333) x) 2.0)))
double code(double x) {
return 2.0 / fma(x, fma(x, ((x * x) * 0.08333333333333333), x), 2.0);
}
function code(x) return Float64(2.0 / fma(x, fma(x, Float64(Float64(x * x) * 0.08333333333333333), x), 2.0)) end
code[x_] := N[(2.0 / N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.08333333333333333), $MachinePrecision] + x), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\mathsf{fma}\left(x, \mathsf{fma}\left(x, \left(x \cdot x\right) \cdot 0.08333333333333333, x\right), 2\right)}
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6486.9
Simplified86.9%
(FPCore (x) :precision binary64 (if (<= x 1.9) (fma x (* x (fma (* x x) 0.20833333333333334 -0.5)) 1.0) (/ 24.0 (* x (* x (* x x))))))
double code(double x) {
double tmp;
if (x <= 1.9) {
tmp = fma(x, (x * fma((x * x), 0.20833333333333334, -0.5)), 1.0);
} else {
tmp = 24.0 / (x * (x * (x * x)));
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= 1.9) tmp = fma(x, Float64(x * fma(Float64(x * x), 0.20833333333333334, -0.5)), 1.0); else tmp = Float64(24.0 / Float64(x * Float64(x * Float64(x * x)))); end return tmp end
code[x_] := If[LessEqual[x, 1.9], N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.20833333333333334 + -0.5), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], N[(24.0 / N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 1.9:\\
\;\;\;\;\mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x \cdot x, 0.20833333333333334, -0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{24}{x \cdot \left(x \cdot \left(x \cdot x\right)\right)}\\
\end{array}
\end{array}
if x < 1.8999999999999999Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6466.7
Simplified66.7%
if 1.8999999999999999 < x Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6478.5
Simplified78.5%
Taylor expanded in x around inf
/-lowering-/.f64N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
unpow2N/A
cube-multN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6478.5
Simplified78.5%
(FPCore (x) :precision binary64 (/ 2.0 (fma x (* x (* (* x x) 0.08333333333333333)) 2.0)))
double code(double x) {
return 2.0 / fma(x, (x * ((x * x) * 0.08333333333333333)), 2.0);
}
function code(x) return Float64(2.0 / fma(x, Float64(x * Float64(Float64(x * x) * 0.08333333333333333)), 2.0)) end
code[x_] := N[(2.0 / N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.08333333333333333), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\mathsf{fma}\left(x, x \cdot \left(\left(x \cdot x\right) \cdot 0.08333333333333333\right), 2\right)}
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6486.9
Simplified86.9%
Taylor expanded in x around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6486.2
Simplified86.2%
(FPCore (x) :precision binary64 (if (<= x 1.25) (fma -0.5 (* x x) 1.0) (/ 2.0 (* x x))))
double code(double x) {
double tmp;
if (x <= 1.25) {
tmp = fma(-0.5, (x * x), 1.0);
} else {
tmp = 2.0 / (x * x);
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= 1.25) tmp = fma(-0.5, Float64(x * x), 1.0); else tmp = Float64(2.0 / Float64(x * x)); end return tmp end
code[x_] := If[LessEqual[x, 1.25], N[(-0.5 * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision], N[(2.0 / N[(x * x), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 1.25:\\
\;\;\;\;\mathsf{fma}\left(-0.5, x \cdot x, 1\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{x \cdot x}\\
\end{array}
\end{array}
if x < 1.25Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f6466.5
Simplified66.5%
if 1.25 < x Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f6457.3
Simplified57.3%
Taylor expanded in x around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6457.3
Simplified57.3%
(FPCore (x) :precision binary64 (/ 2.0 (fma x x 2.0)))
double code(double x) {
return 2.0 / fma(x, x, 2.0);
}
function code(x) return Float64(2.0 / fma(x, x, 2.0)) end
code[x_] := N[(2.0 / N[(x * x + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{\mathsf{fma}\left(x, x, 2\right)}
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
accelerator-lowering-fma.f6476.6
Simplified76.6%
(FPCore (x) :precision binary64 (/ 2.0 (+ 2.0 x)))
double code(double x) {
return 2.0 / (2.0 + x);
}
real(8) function code(x)
real(8), intent (in) :: x
code = 2.0d0 / (2.0d0 + x)
end function
public static double code(double x) {
return 2.0 / (2.0 + x);
}
def code(x): return 2.0 / (2.0 + x)
function code(x) return Float64(2.0 / Float64(2.0 + x)) end
function tmp = code(x) tmp = 2.0 / (2.0 + x); end
code[x_] := N[(2.0 / N[(2.0 + x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{2}{2 + x}
\end{array}
Initial program 100.0%
/-rgt-identityN/A
clear-numN/A
exp-negN/A
/-lowering-/.f64N/A
exp-lowering-exp.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Taylor expanded in x around 0
Simplified73.1%
Taylor expanded in x around 0
+-commutativeN/A
+-lowering-+.f6454.1
Simplified54.1%
Final simplification54.1%
(FPCore (x) :precision binary64 1.0)
double code(double x) {
return 1.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0
end function
public static double code(double x) {
return 1.0;
}
def code(x): return 1.0
function code(x) return 1.0 end
function tmp = code(x) tmp = 1.0; end
code[x_] := 1.0
\begin{array}{l}
\\
1
\end{array}
Initial program 100.0%
Taylor expanded in x around 0
Simplified53.3%
herbie shell --seed 2024199
(FPCore (x)
:name "Hyperbolic secant"
:precision binary64
(/ 2.0 (+ (exp x) (exp (- x)))))