
(FPCore (x) :precision binary64 (/ (- (exp x) 1.0) x))
double code(double x) {
return (exp(x) - 1.0) / x;
}
real(8) function code(x)
real(8), intent (in) :: x
code = (exp(x) - 1.0d0) / x
end function
public static double code(double x) {
return (Math.exp(x) - 1.0) / x;
}
def code(x): return (math.exp(x) - 1.0) / x
function code(x) return Float64(Float64(exp(x) - 1.0) / x) end
function tmp = code(x) tmp = (exp(x) - 1.0) / x; end
code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision]
\begin{array}{l}
\\
\frac{e^{x} - 1}{x}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (/ (- (exp x) 1.0) x))
double code(double x) {
return (exp(x) - 1.0) / x;
}
real(8) function code(x)
real(8), intent (in) :: x
code = (exp(x) - 1.0d0) / x
end function
public static double code(double x) {
return (Math.exp(x) - 1.0) / x;
}
def code(x): return (math.exp(x) - 1.0) / x
function code(x) return Float64(Float64(exp(x) - 1.0) / x) end
function tmp = code(x) tmp = (exp(x) - 1.0) / x; end
code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision] / x), $MachinePrecision]
\begin{array}{l}
\\
\frac{e^{x} - 1}{x}
\end{array}
(FPCore (x) :precision binary64 (/ (expm1 x) x))
double code(double x) {
return expm1(x) / x;
}
public static double code(double x) {
return Math.expm1(x) / x;
}
def code(x): return math.expm1(x) / x
function code(x) return Float64(expm1(x) / x) end
code[x_] := N[(N[(Exp[x] - 1), $MachinePrecision] / x), $MachinePrecision]
\begin{array}{l}
\\
\frac{\mathsf{expm1}\left(x\right)}{x}
\end{array}
Initial program 59.0%
lower-expm1.f64100.0
Applied egg-rr100.0%
(FPCore (x)
:precision binary64
(if (<= (/ (+ (exp x) -1.0) x) 0.005)
(/ 1.0 (fma x -0.5 1.0))
(*
(fma
(fma x (fma x 0.041666666666666664 0.16666666666666666) 0.5)
(* x x)
x)
(/ 1.0 x))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 0.005) {
tmp = 1.0 / fma(x, -0.5, 1.0);
} else {
tmp = fma(fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5), (x * x), x) * (1.0 / x);
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 0.005) tmp = Float64(1.0 / fma(x, -0.5, 1.0)); else tmp = Float64(fma(fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5), Float64(x * x), x) * Float64(1.0 / x)); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 0.005], N[(1.0 / N[(x * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * N[(x * 0.041666666666666664 + 0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision] * N[(x * x), $MachinePrecision] + x), $MachinePrecision] * N[(1.0 / x), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 0.005:\\
\;\;\;\;\frac{1}{\mathsf{fma}\left(x, -0.5, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.041666666666666664, 0.16666666666666666\right), 0.5\right), x \cdot x, x\right) \cdot \frac{1}{x}\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 0.0050000000000000001Initial program 40.9%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6461.5
Simplified61.5%
lift-fma.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6461.5
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6461.5
Applied egg-rr61.5%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6468.4
Simplified68.4%
if 0.0050000000000000001 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 96.3%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6482.8
Simplified82.8%
lift-fma.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
div-invN/A
lower-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f6482.9
Applied egg-rr82.9%
Final simplification73.1%
(FPCore (x)
:precision binary64
(if (<= (/ (+ (exp x) -1.0) x) 0.999)
(/ 1.0 (fma x -0.5 1.0))
(/
(fma
x
(* x (fma x (fma x 0.041666666666666664 0.16666666666666666) 0.5))
x)
x)))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 0.999) {
tmp = 1.0 / fma(x, -0.5, 1.0);
} else {
tmp = fma(x, (x * fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5)), x) / x;
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 0.999) tmp = Float64(1.0 / fma(x, -0.5, 1.0)); else tmp = Float64(fma(x, Float64(x * fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5)), x) / x); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 0.999], N[(1.0 / N[(x * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(x * N[(x * N[(x * 0.041666666666666664 + 0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision] / x), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 0.999:\\
\;\;\;\;\frac{1}{\mathsf{fma}\left(x, -0.5, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.041666666666666664, 0.16666666666666666\right), 0.5\right), x\right)}{x}\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 0.998999999999999999Initial program 40.8%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6461.7
Simplified61.7%
lift-fma.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6461.7
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6461.7
Applied egg-rr61.7%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6468.5
Simplified68.5%
if 0.998999999999999999 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 97.0%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6482.6
Simplified82.6%
Final simplification73.1%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) (/ 1.0 (fma x -0.5 1.0)) (/ (* 0.041666666666666664 (* x (* x (* x x)))) x)))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = 1.0 / fma(x, -0.5, 1.0);
} else {
tmp = (0.041666666666666664 * (x * (x * (x * x)))) / x;
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = Float64(1.0 / fma(x, -0.5, 1.0)); else tmp = Float64(Float64(0.041666666666666664 * Float64(x * Float64(x * Float64(x * x)))) / x); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(1.0 / N[(x * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.041666666666666664 * N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;\frac{1}{\mathsf{fma}\left(x, -0.5, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.041666666666666664 \cdot \left(x \cdot \left(x \cdot \left(x \cdot x\right)\right)\right)}{x}\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 41.4%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6463.0
Simplified63.0%
lift-fma.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6463.0
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6463.0
Applied egg-rr63.0%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6469.3
Simplified69.3%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6481.3
Simplified81.3%
Taylor expanded in x around inf
lower-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6481.3
Simplified81.3%
Final simplification72.9%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 0.005) (/ 1.0 (fma x -0.5 1.0)) (fma x (fma x (fma x 0.041666666666666664 0.16666666666666666) 0.5) 1.0)))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 0.005) {
tmp = 1.0 / fma(x, -0.5, 1.0);
} else {
tmp = fma(x, fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5), 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 0.005) tmp = Float64(1.0 / fma(x, -0.5, 1.0)); else tmp = fma(x, fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5), 1.0); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 0.005], N[(1.0 / N[(x * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], N[(x * N[(x * N[(x * 0.041666666666666664 + 0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 0.005:\\
\;\;\;\;\frac{1}{\mathsf{fma}\left(x, -0.5, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.041666666666666664, 0.16666666666666666\right), 0.5\right), 1\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 0.0050000000000000001Initial program 40.9%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6461.5
Simplified61.5%
lift-fma.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6461.5
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6461.5
Applied egg-rr61.5%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6468.4
Simplified68.4%
if 0.0050000000000000001 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 96.3%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6475.2
Simplified75.2%
Final simplification70.6%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) (/ 1.0 (fma x -0.5 1.0)) (* x (* x (fma x 0.125 0.25)))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = 1.0 / fma(x, -0.5, 1.0);
} else {
tmp = x * (x * fma(x, 0.125, 0.25));
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = Float64(1.0 / fma(x, -0.5, 1.0)); else tmp = Float64(x * Float64(x * fma(x, 0.125, 0.25))); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(1.0 / N[(x * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], N[(x * N[(x * N[(x * 0.125 + 0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;\frac{1}{\mathsf{fma}\left(x, -0.5, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(x \cdot \mathsf{fma}\left(x, 0.125, 0.25\right)\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 41.4%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6463.0
Simplified63.0%
lift-fma.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6463.0
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6463.0
Applied egg-rr63.0%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6469.3
Simplified69.3%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f645.8
Simplified5.8%
flip-+N/A
metadata-evalN/A
div-subN/A
sub-negN/A
flip3--N/A
associate-/r/N/A
lower-fma.f64N/A
Applied egg-rr1.2%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6415.8
Simplified15.8%
Taylor expanded in x around inf
cube-multN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
rgt-mult-inverseN/A
metadata-evalN/A
lower-fma.f6472.9
Simplified72.9%
Final simplification70.4%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) (fma x (fma x 0.16666666666666666 0.5) 1.0) (* x (* x (fma x 0.125 0.25)))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
} else {
tmp = x * (x * fma(x, 0.125, 0.25));
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0); else tmp = Float64(x * Float64(x * fma(x, 0.125, 0.25))); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision], N[(x * N[(x * N[(x * 0.125 + 0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(x \cdot \mathsf{fma}\left(x, 0.125, 0.25\right)\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 41.4%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6463.6
Simplified63.6%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f645.8
Simplified5.8%
flip-+N/A
metadata-evalN/A
div-subN/A
sub-negN/A
flip3--N/A
associate-/r/N/A
lower-fma.f64N/A
Applied egg-rr1.2%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6415.8
Simplified15.8%
Taylor expanded in x around inf
cube-multN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
rgt-mult-inverseN/A
metadata-evalN/A
lower-fma.f6472.9
Simplified72.9%
Final simplification66.4%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) (fma x (fma x 0.16666666666666666 0.5) 1.0) (* x (* (* x x) 0.125))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
} else {
tmp = x * ((x * x) * 0.125);
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0); else tmp = Float64(x * Float64(Float64(x * x) * 0.125)); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision], N[(x * N[(N[(x * x), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(\left(x \cdot x\right) \cdot 0.125\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 41.4%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6463.6
Simplified63.6%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f645.8
Simplified5.8%
flip-+N/A
metadata-evalN/A
div-subN/A
sub-negN/A
flip3--N/A
associate-/r/N/A
lower-fma.f64N/A
Applied egg-rr1.2%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6415.8
Simplified15.8%
Taylor expanded in x around inf
cube-multN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6472.9
Simplified72.9%
Final simplification66.4%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) (fma x (fma x 0.16666666666666666 0.5) 1.0) (* x (* x (* x 0.041666666666666664)))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
} else {
tmp = x * (x * (x * 0.041666666666666664));
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = fma(x, fma(x, 0.16666666666666666, 0.5), 1.0); else tmp = Float64(x * Float64(x * Float64(x * 0.041666666666666664))); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision], N[(x * N[(x * N[(x * 0.041666666666666664), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(x \cdot \left(x \cdot 0.041666666666666664\right)\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 41.4%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6463.6
Simplified63.6%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6481.3
Simplified81.3%
Taylor expanded in x around inf
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.9
Simplified72.9%
Final simplification66.4%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) 1.0 (* x (fma x 0.16666666666666666 0.5))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = 1.0;
} else {
tmp = x * fma(x, 0.16666666666666666, 0.5);
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = 1.0; else tmp = Float64(x * fma(x, 0.16666666666666666, 0.5)); end return tmp end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], 1.0, N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;1\\
\mathbf{else}:\\
\;\;\;\;x \cdot \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 41.4%
Taylor expanded in x around 0
Simplified63.2%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6459.3
Simplified59.3%
Taylor expanded in x around inf
unpow2N/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt-inN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6459.3
Simplified59.3%
Final simplification62.0%
(FPCore (x) :precision binary64 (if (<= (/ (+ (exp x) -1.0) x) 2.0) 1.0 (* x (* x 0.16666666666666666))))
double code(double x) {
double tmp;
if (((exp(x) + -1.0) / x) <= 2.0) {
tmp = 1.0;
} else {
tmp = x * (x * 0.16666666666666666);
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: tmp
if (((exp(x) + (-1.0d0)) / x) <= 2.0d0) then
tmp = 1.0d0
else
tmp = x * (x * 0.16666666666666666d0)
end if
code = tmp
end function
public static double code(double x) {
double tmp;
if (((Math.exp(x) + -1.0) / x) <= 2.0) {
tmp = 1.0;
} else {
tmp = x * (x * 0.16666666666666666);
}
return tmp;
}
def code(x): tmp = 0 if ((math.exp(x) + -1.0) / x) <= 2.0: tmp = 1.0 else: tmp = x * (x * 0.16666666666666666) return tmp
function code(x) tmp = 0.0 if (Float64(Float64(exp(x) + -1.0) / x) <= 2.0) tmp = 1.0; else tmp = Float64(x * Float64(x * 0.16666666666666666)); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (((exp(x) + -1.0) / x) <= 2.0) tmp = 1.0; else tmp = x * (x * 0.16666666666666666); end tmp_2 = tmp; end
code[x_] := If[LessEqual[N[(N[(N[Exp[x], $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision], 2.0], 1.0, N[(x * N[(x * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{e^{x} + -1}{x} \leq 2:\\
\;\;\;\;1\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(x \cdot 0.16666666666666666\right)\\
\end{array}
\end{array}
if (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) < 2Initial program 41.4%
Taylor expanded in x around 0
Simplified63.2%
if 2 < (/.f64 (-.f64 (exp.f64 x) #s(literal 1 binary64)) x) Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6459.3
Simplified59.3%
Taylor expanded in x around inf
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6459.3
Simplified59.3%
Final simplification62.0%
(FPCore (x)
:precision binary64
(let* ((t_0 (fma x (fma x 0.041666666666666664 0.16666666666666666) 0.5))
(t_1 (fma t_0 (* x x) (- x))))
(if (<= x 1e-164)
(/ 1.0 (fma x -0.5 1.0))
(if (<= x 8.4e+61)
(/ (* (fma t_0 (* x x) x) t_1) (* x t_1))
(/ (* 0.041666666666666664 (* x (* x (* x x)))) x)))))
double code(double x) {
double t_0 = fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5);
double t_1 = fma(t_0, (x * x), -x);
double tmp;
if (x <= 1e-164) {
tmp = 1.0 / fma(x, -0.5, 1.0);
} else if (x <= 8.4e+61) {
tmp = (fma(t_0, (x * x), x) * t_1) / (x * t_1);
} else {
tmp = (0.041666666666666664 * (x * (x * (x * x)))) / x;
}
return tmp;
}
function code(x) t_0 = fma(x, fma(x, 0.041666666666666664, 0.16666666666666666), 0.5) t_1 = fma(t_0, Float64(x * x), Float64(-x)) tmp = 0.0 if (x <= 1e-164) tmp = Float64(1.0 / fma(x, -0.5, 1.0)); elseif (x <= 8.4e+61) tmp = Float64(Float64(fma(t_0, Float64(x * x), x) * t_1) / Float64(x * t_1)); else tmp = Float64(Float64(0.041666666666666664 * Float64(x * Float64(x * Float64(x * x)))) / x); end return tmp end
code[x_] := Block[{t$95$0 = N[(x * N[(x * 0.041666666666666664 + 0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * N[(x * x), $MachinePrecision] + (-x)), $MachinePrecision]}, If[LessEqual[x, 1e-164], N[(1.0 / N[(x * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8.4e+61], N[(N[(N[(t$95$0 * N[(x * x), $MachinePrecision] + x), $MachinePrecision] * t$95$1), $MachinePrecision] / N[(x * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(0.041666666666666664 * N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.041666666666666664, 0.16666666666666666\right), 0.5\right)\\
t_1 := \mathsf{fma}\left(t\_0, x \cdot x, -x\right)\\
\mathbf{if}\;x \leq 10^{-164}:\\
\;\;\;\;\frac{1}{\mathsf{fma}\left(x, -0.5, 1\right)}\\
\mathbf{elif}\;x \leq 8.4 \cdot 10^{+61}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t\_0, x \cdot x, x\right) \cdot t\_1}{x \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.041666666666666664 \cdot \left(x \cdot \left(x \cdot \left(x \cdot x\right)\right)\right)}{x}\\
\end{array}
\end{array}
if x < 9.99999999999999962e-165Initial program 46.8%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6456.4
Simplified56.4%
lift-fma.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6456.4
lift-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6456.4
Applied egg-rr56.4%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6464.1
Simplified64.1%
if 9.99999999999999962e-165 < x < 8.4000000000000004e61Initial program 41.4%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6467.2
Simplified67.2%
lift-fma.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/l/N/A
lower-/.f64N/A
Applied egg-rr81.2%
if 8.4000000000000004e61 < x Initial program 100.0%
Taylor expanded in x around 0
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6498.5
Simplified98.5%
Taylor expanded in x around inf
lower-*.f64N/A
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6498.5
Simplified98.5%
(FPCore (x) :precision binary64 (fma x (fma x 0.16666666666666666 0.5) 1.0))
double code(double x) {
return fma(x, fma(x, 0.16666666666666666, 0.5), 1.0);
}
function code(x) return fma(x, fma(x, 0.16666666666666666, 0.5), 1.0) end
code[x_] := N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), 1\right)
\end{array}
Initial program 59.0%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6462.3
Simplified62.3%
(FPCore (x) :precision binary64 (fma x 0.5 1.0))
double code(double x) {
return fma(x, 0.5, 1.0);
}
function code(x) return fma(x, 0.5, 1.0) end
code[x_] := N[(x * 0.5 + 1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(x, 0.5, 1\right)
\end{array}
Initial program 59.0%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6445.7
Simplified45.7%
(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 59.0%
Taylor expanded in x around 0
Simplified45.1%
(FPCore (x) :precision binary64 0.0)
double code(double x) {
return 0.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 0.0d0
end function
public static double code(double x) {
return 0.0;
}
def code(x): return 0.0
function code(x) return 0.0 end
function tmp = code(x) tmp = 0.0; end
code[x_] := 0.0
\begin{array}{l}
\\
0
\end{array}
Initial program 59.0%
Taylor expanded in x around 0
Simplified3.4%
metadata-evalN/A
div03.4
Applied egg-rr3.4%
(FPCore (x) :precision binary64 (let* ((t_0 (- (exp x) 1.0))) (if (and (< x 1.0) (> x -1.0)) (/ t_0 (log (exp x))) (/ t_0 x))))
double code(double x) {
double t_0 = exp(x) - 1.0;
double tmp;
if ((x < 1.0) && (x > -1.0)) {
tmp = t_0 / log(exp(x));
} else {
tmp = t_0 / x;
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: t_0
real(8) :: tmp
t_0 = exp(x) - 1.0d0
if ((x < 1.0d0) .and. (x > (-1.0d0))) then
tmp = t_0 / log(exp(x))
else
tmp = t_0 / x
end if
code = tmp
end function
public static double code(double x) {
double t_0 = Math.exp(x) - 1.0;
double tmp;
if ((x < 1.0) && (x > -1.0)) {
tmp = t_0 / Math.log(Math.exp(x));
} else {
tmp = t_0 / x;
}
return tmp;
}
def code(x): t_0 = math.exp(x) - 1.0 tmp = 0 if (x < 1.0) and (x > -1.0): tmp = t_0 / math.log(math.exp(x)) else: tmp = t_0 / x return tmp
function code(x) t_0 = Float64(exp(x) - 1.0) tmp = 0.0 if ((x < 1.0) && (x > -1.0)) tmp = Float64(t_0 / log(exp(x))); else tmp = Float64(t_0 / x); end return tmp end
function tmp_2 = code(x) t_0 = exp(x) - 1.0; tmp = 0.0; if ((x < 1.0) && (x > -1.0)) tmp = t_0 / log(exp(x)); else tmp = t_0 / x; end tmp_2 = tmp; end
code[x_] := Block[{t$95$0 = N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision]}, If[And[Less[x, 1.0], Greater[x, -1.0]], N[(t$95$0 / N[Log[N[Exp[x], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 / x), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{x} - 1\\
\mathbf{if}\;x < 1 \land x > -1:\\
\;\;\;\;\frac{t\_0}{\log \left(e^{x}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{x}\\
\end{array}
\end{array}
herbie shell --seed 2024207
(FPCore (x)
:name "Kahan's exp quotient"
:precision binary64
:alt
(! :herbie-platform default (if (and (< x 1) (> x -1)) (/ (- (exp x) 1) (log (exp x))) (/ (- (exp x) 1) x)))
(/ (- (exp x) 1.0) x))