
(FPCore (x) :precision binary64 (/ (exp x) (- (exp x) 1.0)))
double code(double x) {
return exp(x) / (exp(x) - 1.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = exp(x) / (exp(x) - 1.0d0)
end function
public static double code(double x) {
return Math.exp(x) / (Math.exp(x) - 1.0);
}
def code(x): return math.exp(x) / (math.exp(x) - 1.0)
function code(x) return Float64(exp(x) / Float64(exp(x) - 1.0)) end
function tmp = code(x) tmp = exp(x) / (exp(x) - 1.0); end
code[x_] := N[(N[Exp[x], $MachinePrecision] / N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e^{x}}{e^{x} - 1}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (/ (exp x) (- (exp x) 1.0)))
double code(double x) {
return exp(x) / (exp(x) - 1.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = exp(x) / (exp(x) - 1.0d0)
end function
public static double code(double x) {
return Math.exp(x) / (Math.exp(x) - 1.0);
}
def code(x): return math.exp(x) / (math.exp(x) - 1.0)
function code(x) return Float64(exp(x) / Float64(exp(x) - 1.0)) end
function tmp = code(x) tmp = exp(x) / (exp(x) - 1.0); end
code[x_] := N[(N[Exp[x], $MachinePrecision] / N[(N[Exp[x], $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{e^{x}}{e^{x} - 1}
\end{array}
(FPCore (x) :precision binary64 (/ -1.0 (expm1 (- 0.0 x))))
double code(double x) {
return -1.0 / expm1((0.0 - x));
}
public static double code(double x) {
return -1.0 / Math.expm1((0.0 - x));
}
def code(x): return -1.0 / math.expm1((0.0 - x))
function code(x) return Float64(-1.0 / expm1(Float64(0.0 - x))) end
code[x_] := N[(-1.0 / N[(Exp[N[(0.0 - x), $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{-1}{\mathsf{expm1}\left(0 - x\right)}
\end{array}
Initial program 35.0%
clear-numN/A
frac-2negN/A
/-lowering-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
+-commutativeN/A
sub-negN/A
div-subN/A
rec-expN/A
*-inversesN/A
accelerator-lowering-expm1.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Final simplification100.0%
(FPCore (x)
:precision binary64
(if (<= (exp x) 0.0)
(/ (exp x) x)
(fma
x
(fma x (* x -0.001388888888888889) 0.08333333333333333)
(+ (/ 1.0 x) 0.5))))
double code(double x) {
double tmp;
if (exp(x) <= 0.0) {
tmp = exp(x) / x;
} else {
tmp = fma(x, fma(x, (x * -0.001388888888888889), 0.08333333333333333), ((1.0 / x) + 0.5));
}
return tmp;
}
function code(x) tmp = 0.0 if (exp(x) <= 0.0) tmp = Float64(exp(x) / x); else tmp = fma(x, fma(x, Float64(x * -0.001388888888888889), 0.08333333333333333), Float64(Float64(1.0 / x) + 0.5)); end return tmp end
code[x_] := If[LessEqual[N[Exp[x], $MachinePrecision], 0.0], N[(N[Exp[x], $MachinePrecision] / x), $MachinePrecision], N[(x * N[(x * N[(x * -0.001388888888888889), $MachinePrecision] + 0.08333333333333333), $MachinePrecision] + N[(N[(1.0 / x), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{x} \leq 0:\\
\;\;\;\;\frac{e^{x}}{x}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, x \cdot -0.001388888888888889, 0.08333333333333333\right), \frac{1}{x} + 0.5\right)\\
\end{array}
\end{array}
if (exp.f64 x) < 0.0Initial program 100.0%
Taylor expanded in x around 0
Simplified100.0%
if 0.0 < (exp.f64 x) Initial program 8.6%
Taylor expanded in x around 0
*-lft-identityN/A
associate-/l*N/A
associate-*l/N/A
distribute-lft-inN/A
*-commutativeN/A
associate-+r+N/A
distribute-lft-inN/A
associate-*l/N/A
*-lft-identityN/A
+-commutativeN/A
associate-*r*N/A
lft-mult-inverseN/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
Simplified98.9%
(FPCore (x)
:precision binary64
(if (<= (exp x) 0.0)
(/ -8.0 (* x (* x (* x x))))
(fma
x
(fma x (* x -0.001388888888888889) 0.08333333333333333)
(+ (/ 1.0 x) 0.5))))
double code(double x) {
double tmp;
if (exp(x) <= 0.0) {
tmp = -8.0 / (x * (x * (x * x)));
} else {
tmp = fma(x, fma(x, (x * -0.001388888888888889), 0.08333333333333333), ((1.0 / x) + 0.5));
}
return tmp;
}
function code(x) tmp = 0.0 if (exp(x) <= 0.0) tmp = Float64(-8.0 / Float64(x * Float64(x * Float64(x * x)))); else tmp = fma(x, fma(x, Float64(x * -0.001388888888888889), 0.08333333333333333), Float64(Float64(1.0 / x) + 0.5)); end return tmp end
code[x_] := If[LessEqual[N[Exp[x], $MachinePrecision], 0.0], N[(-8.0 / N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(x * N[(x * -0.001388888888888889), $MachinePrecision] + 0.08333333333333333), $MachinePrecision] + N[(N[(1.0 / x), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{x} \leq 0:\\
\;\;\;\;\frac{-8}{x \cdot \left(x \cdot \left(x \cdot x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, x \cdot -0.001388888888888889, 0.08333333333333333\right), \frac{1}{x} + 0.5\right)\\
\end{array}
\end{array}
if (exp.f64 x) < 0.0Initial program 100.0%
Taylor expanded in x around 0
*-lft-identityN/A
associate-*l/N/A
distribute-rgt-inN/A
*-lft-identityN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
rgt-mult-inverseN/A
metadata-eval3.1
Simplified3.1%
+-commutativeN/A
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
distribute-frac-neg2N/A
+-lowering-+.f64N/A
metadata-evalN/A
frac-2negN/A
/-lowering-/.f64N/A
--lowering--.f64N/A
metadata-evalN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f643.1
Applied egg-rr3.1%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6473.1
Simplified73.1%
Taylor expanded in x around inf
/-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-*.f6473.1
Simplified73.1%
if 0.0 < (exp.f64 x) Initial program 8.6%
Taylor expanded in x around 0
*-lft-identityN/A
associate-/l*N/A
associate-*l/N/A
distribute-lft-inN/A
*-commutativeN/A
associate-+r+N/A
distribute-lft-inN/A
associate-*l/N/A
*-lft-identityN/A
+-commutativeN/A
associate-*r*N/A
lft-mult-inverseN/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
Simplified98.9%
(FPCore (x) :precision binary64 (if (<= (exp x) 0.0) (/ -8.0 (* x (* x (* x x)))) (/ (fma x (fma x 0.08333333333333333 0.5) 1.0) x)))
double code(double x) {
double tmp;
if (exp(x) <= 0.0) {
tmp = -8.0 / (x * (x * (x * x)));
} else {
tmp = fma(x, fma(x, 0.08333333333333333, 0.5), 1.0) / x;
}
return tmp;
}
function code(x) tmp = 0.0 if (exp(x) <= 0.0) tmp = Float64(-8.0 / Float64(x * Float64(x * Float64(x * x)))); else tmp = Float64(fma(x, fma(x, 0.08333333333333333, 0.5), 1.0) / x); end return tmp end
code[x_] := If[LessEqual[N[Exp[x], $MachinePrecision], 0.0], N[(-8.0 / N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(x * 0.08333333333333333 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] / x), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{x} \leq 0:\\
\;\;\;\;\frac{-8}{x \cdot \left(x \cdot \left(x \cdot x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.08333333333333333, 0.5\right), 1\right)}{x}\\
\end{array}
\end{array}
if (exp.f64 x) < 0.0Initial program 100.0%
Taylor expanded in x around 0
*-lft-identityN/A
associate-*l/N/A
distribute-rgt-inN/A
*-lft-identityN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
rgt-mult-inverseN/A
metadata-eval3.1
Simplified3.1%
+-commutativeN/A
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
distribute-frac-neg2N/A
+-lowering-+.f64N/A
metadata-evalN/A
frac-2negN/A
/-lowering-/.f64N/A
--lowering--.f64N/A
metadata-evalN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f643.1
Applied egg-rr3.1%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6473.1
Simplified73.1%
Taylor expanded in x around inf
/-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-*.f6473.1
Simplified73.1%
if 0.0 < (exp.f64 x) Initial program 8.6%
clear-numN/A
frac-2negN/A
/-lowering-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
+-commutativeN/A
sub-negN/A
div-subN/A
rec-expN/A
*-inversesN/A
accelerator-lowering-expm1.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Taylor expanded in x around 0
Simplified98.8%
(FPCore (x) :precision binary64 (if (<= (exp x) 0.0) (/ -2.0 (* x x)) (fma x 0.08333333333333333 (+ (/ 1.0 x) 0.5))))
double code(double x) {
double tmp;
if (exp(x) <= 0.0) {
tmp = -2.0 / (x * x);
} else {
tmp = fma(x, 0.08333333333333333, ((1.0 / x) + 0.5));
}
return tmp;
}
function code(x) tmp = 0.0 if (exp(x) <= 0.0) tmp = Float64(-2.0 / Float64(x * x)); else tmp = fma(x, 0.08333333333333333, Float64(Float64(1.0 / x) + 0.5)); end return tmp end
code[x_] := If[LessEqual[N[Exp[x], $MachinePrecision], 0.0], N[(-2.0 / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(x * 0.08333333333333333 + N[(N[(1.0 / x), $MachinePrecision] + 0.5), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{x} \leq 0:\\
\;\;\;\;\frac{-2}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(x, 0.08333333333333333, \frac{1}{x} + 0.5\right)\\
\end{array}
\end{array}
if (exp.f64 x) < 0.0Initial program 100.0%
clear-numN/A
frac-2negN/A
/-lowering-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
+-commutativeN/A
sub-negN/A
div-subN/A
rec-expN/A
*-inversesN/A
accelerator-lowering-expm1.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Taylor expanded in x around 0
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6450.0
Simplified50.0%
Taylor expanded in x around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6450.0
Simplified50.0%
if 0.0 < (exp.f64 x) Initial program 8.6%
Taylor expanded in x around 0
*-lft-identityN/A
associate-/l*N/A
associate-*l/N/A
+-commutativeN/A
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-+l+N/A
+-commutativeN/A
distribute-lft-inN/A
associate-*r*N/A
lft-mult-inverseN/A
*-lft-identityN/A
*-commutativeN/A
associate-*l/N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
*-lft-identityN/A
associate-*l/N/A
distribute-rgt-inN/A
Simplified98.8%
(FPCore (x) :precision binary64 (if (<= (exp x) 0.0) (/ -2.0 (* x x)) (+ (/ 1.0 x) 0.5)))
double code(double x) {
double tmp;
if (exp(x) <= 0.0) {
tmp = -2.0 / (x * x);
} else {
tmp = (1.0 / x) + 0.5;
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: tmp
if (exp(x) <= 0.0d0) then
tmp = (-2.0d0) / (x * x)
else
tmp = (1.0d0 / x) + 0.5d0
end if
code = tmp
end function
public static double code(double x) {
double tmp;
if (Math.exp(x) <= 0.0) {
tmp = -2.0 / (x * x);
} else {
tmp = (1.0 / x) + 0.5;
}
return tmp;
}
def code(x): tmp = 0 if math.exp(x) <= 0.0: tmp = -2.0 / (x * x) else: tmp = (1.0 / x) + 0.5 return tmp
function code(x) tmp = 0.0 if (exp(x) <= 0.0) tmp = Float64(-2.0 / Float64(x * x)); else tmp = Float64(Float64(1.0 / x) + 0.5); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (exp(x) <= 0.0) tmp = -2.0 / (x * x); else tmp = (1.0 / x) + 0.5; end tmp_2 = tmp; end
code[x_] := If[LessEqual[N[Exp[x], $MachinePrecision], 0.0], N[(-2.0 / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / x), $MachinePrecision] + 0.5), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;e^{x} \leq 0:\\
\;\;\;\;\frac{-2}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x} + 0.5\\
\end{array}
\end{array}
if (exp.f64 x) < 0.0Initial program 100.0%
clear-numN/A
frac-2negN/A
/-lowering-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
+-commutativeN/A
sub-negN/A
div-subN/A
rec-expN/A
*-inversesN/A
accelerator-lowering-expm1.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Taylor expanded in x around 0
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6450.0
Simplified50.0%
Taylor expanded in x around inf
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6450.0
Simplified50.0%
if 0.0 < (exp.f64 x) Initial program 8.6%
Taylor expanded in x around 0
*-lft-identityN/A
associate-*l/N/A
distribute-rgt-inN/A
*-lft-identityN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
rgt-mult-inverseN/A
metadata-eval97.7
Simplified97.7%
(FPCore (x)
:precision binary64
(let* ((t_0 (fma x (fma x 0.041666666666666664 -0.16666666666666666) 0.5)))
(if (<= x -2e+105)
(/ -24.0 (* x (* x (* x x))))
(/ -1.0 (/ (* x (fma t_0 (* (* x x) t_0) -1.0)) (fma x t_0 1.0))))))
double code(double x) {
double t_0 = fma(x, fma(x, 0.041666666666666664, -0.16666666666666666), 0.5);
double tmp;
if (x <= -2e+105) {
tmp = -24.0 / (x * (x * (x * x)));
} else {
tmp = -1.0 / ((x * fma(t_0, ((x * x) * t_0), -1.0)) / fma(x, t_0, 1.0));
}
return tmp;
}
function code(x) t_0 = fma(x, fma(x, 0.041666666666666664, -0.16666666666666666), 0.5) tmp = 0.0 if (x <= -2e+105) tmp = Float64(-24.0 / Float64(x * Float64(x * Float64(x * x)))); else tmp = Float64(-1.0 / Float64(Float64(x * fma(t_0, Float64(Float64(x * x) * t_0), -1.0)) / fma(x, t_0, 1.0))); end return tmp end
code[x_] := Block[{t$95$0 = N[(x * N[(x * 0.041666666666666664 + -0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision]}, If[LessEqual[x, -2e+105], N[(-24.0 / N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(N[(x * N[(t$95$0 * N[(N[(x * x), $MachinePrecision] * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] / N[(x * t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]), $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)\\
\mathbf{if}\;x \leq -2 \cdot 10^{+105}:\\
\;\;\;\;\frac{-24}{x \cdot \left(x \cdot \left(x \cdot x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{x \cdot \mathsf{fma}\left(t\_0, \left(x \cdot x\right) \cdot t\_0, -1\right)}{\mathsf{fma}\left(x, t\_0, 1\right)}}\\
\end{array}
\end{array}
if x < -1.9999999999999999e105Initial program 100.0%
clear-numN/A
frac-2negN/A
/-lowering-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
+-commutativeN/A
sub-negN/A
div-subN/A
rec-expN/A
*-inversesN/A
accelerator-lowering-expm1.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Taylor expanded in x around 0
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.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%
if -1.9999999999999999e105 < x Initial program 21.1%
clear-numN/A
frac-2negN/A
/-lowering-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
+-commutativeN/A
sub-negN/A
div-subN/A
rec-expN/A
*-inversesN/A
accelerator-lowering-expm1.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Taylor expanded in x around 0
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6489.2
Simplified89.2%
+-rgt-identityN/A
*-commutativeN/A
flip-+N/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr93.2%
Final simplification94.4%
(FPCore (x) :precision binary64 (/ -1.0 (fma x (fma x (fma x (fma x 0.041666666666666664 -0.16666666666666666) 0.5) -1.0) 0.0)))
double code(double x) {
return -1.0 / fma(x, fma(x, fma(x, fma(x, 0.041666666666666664, -0.16666666666666666), 0.5), -1.0), 0.0);
}
function code(x) return Float64(-1.0 / fma(x, fma(x, fma(x, fma(x, 0.041666666666666664, -0.16666666666666666), 0.5), -1.0), 0.0)) end
code[x_] := N[(-1.0 / N[(x * N[(x * N[(x * N[(x * 0.041666666666666664 + -0.16666666666666666), $MachinePrecision] + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 0.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{-1}{\mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.041666666666666664, -0.16666666666666666\right), 0.5\right), -1\right), 0\right)}
\end{array}
Initial program 35.0%
clear-numN/A
frac-2negN/A
/-lowering-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
+-commutativeN/A
sub-negN/A
div-subN/A
rec-expN/A
*-inversesN/A
accelerator-lowering-expm1.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Taylor expanded in x around 0
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6491.1
Simplified91.1%
(FPCore (x) :precision binary64 (/ 1.0 (* x (fma x (fma x (fma x -0.125 0.25) -0.5) 1.0))))
double code(double x) {
return 1.0 / (x * fma(x, fma(x, fma(x, -0.125, 0.25), -0.5), 1.0));
}
function code(x) return Float64(1.0 / Float64(x * fma(x, fma(x, fma(x, -0.125, 0.25), -0.5), 1.0))) end
code[x_] := N[(1.0 / N[(x * N[(x * N[(x * N[(x * -0.125 + 0.25), $MachinePrecision] + -0.5), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{x \cdot \mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.125, 0.25\right), -0.5\right), 1\right)}
\end{array}
Initial program 35.0%
Taylor expanded in x around 0
*-lft-identityN/A
associate-*l/N/A
distribute-rgt-inN/A
*-lft-identityN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
rgt-mult-inverseN/A
metadata-eval70.4
Simplified70.4%
+-commutativeN/A
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
distribute-frac-neg2N/A
+-lowering-+.f64N/A
metadata-evalN/A
frac-2negN/A
/-lowering-/.f64N/A
--lowering--.f64N/A
metadata-evalN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6434.1
Applied egg-rr34.1%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6490.5
Simplified90.5%
(FPCore (x) :precision binary64 (if (<= x -0.082) (/ -24.0 (* x (* x (* x x)))) (/ (fma x (fma x 0.08333333333333333 0.5) 1.0) x)))
double code(double x) {
double tmp;
if (x <= -0.082) {
tmp = -24.0 / (x * (x * (x * x)));
} else {
tmp = fma(x, fma(x, 0.08333333333333333, 0.5), 1.0) / x;
}
return tmp;
}
function code(x) tmp = 0.0 if (x <= -0.082) tmp = Float64(-24.0 / Float64(x * Float64(x * Float64(x * x)))); else tmp = Float64(fma(x, fma(x, 0.08333333333333333, 0.5), 1.0) / x); end return tmp end
code[x_] := If[LessEqual[x, -0.082], N[(-24.0 / N[(x * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(x * 0.08333333333333333 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] / x), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -0.082:\\
\;\;\;\;\frac{-24}{x \cdot \left(x \cdot \left(x \cdot x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.08333333333333333, 0.5\right), 1\right)}{x}\\
\end{array}
\end{array}
if x < -0.0820000000000000034Initial program 100.0%
clear-numN/A
frac-2negN/A
/-lowering-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
+-commutativeN/A
sub-negN/A
div-subN/A
rec-expN/A
*-inversesN/A
accelerator-lowering-expm1.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Taylor expanded in x around 0
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6473.1
Simplified73.1%
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-*.f6473.1
Simplified73.1%
if -0.0820000000000000034 < x Initial program 8.6%
clear-numN/A
frac-2negN/A
/-lowering-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
+-commutativeN/A
sub-negN/A
div-subN/A
rec-expN/A
*-inversesN/A
accelerator-lowering-expm1.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Taylor expanded in x around 0
Simplified98.8%
(FPCore (x) :precision binary64 (/ -1.0 (fma (* x x) 0.5 (- 0.0 x))))
double code(double x) {
return -1.0 / fma((x * x), 0.5, (0.0 - x));
}
function code(x) return Float64(-1.0 / fma(Float64(x * x), 0.5, Float64(0.0 - x))) end
code[x_] := N[(-1.0 / N[(N[(x * x), $MachinePrecision] * 0.5 + N[(0.0 - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{-1}{\mathsf{fma}\left(x \cdot x, 0.5, 0 - x\right)}
\end{array}
Initial program 35.0%
clear-numN/A
frac-2negN/A
/-lowering-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
+-commutativeN/A
sub-negN/A
div-subN/A
rec-expN/A
*-inversesN/A
accelerator-lowering-expm1.f64N/A
neg-lowering-neg.f64100.0
Applied egg-rr100.0%
Taylor expanded in x around 0
+-rgt-identityN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6483.7
Simplified83.7%
+-rgt-identityN/A
distribute-lft-inN/A
associate-*r*N/A
*-commutativeN/A
neg-mul-1N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
--lowering--.f6483.7
Applied egg-rr83.7%
(FPCore (x) :precision binary64 (/ 1.0 (* x (fma x -0.5 1.0))))
double code(double x) {
return 1.0 / (x * fma(x, -0.5, 1.0));
}
function code(x) return Float64(1.0 / Float64(x * fma(x, -0.5, 1.0))) end
code[x_] := N[(1.0 / N[(x * N[(x * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{x \cdot \mathsf{fma}\left(x, -0.5, 1\right)}
\end{array}
Initial program 35.0%
Taylor expanded in x around 0
*-lft-identityN/A
associate-*l/N/A
distribute-rgt-inN/A
*-lft-identityN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
rgt-mult-inverseN/A
metadata-eval70.4
Simplified70.4%
+-commutativeN/A
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sub-negN/A
distribute-frac-neg2N/A
+-lowering-+.f64N/A
metadata-evalN/A
frac-2negN/A
/-lowering-/.f64N/A
--lowering--.f64N/A
metadata-evalN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6434.1
Applied egg-rr34.1%
Taylor expanded in x around 0
+-commutativeN/A
lft-mult-inverseN/A
distribute-rgt-inN/A
+-commutativeN/A
metadata-evalN/A
sub-negN/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
distribute-lft-inN/A
rgt-mult-inverseN/A
accelerator-lowering-fma.f6483.7
Simplified83.7%
(FPCore (x) :precision binary64 (+ (/ 1.0 x) 0.5))
double code(double x) {
return (1.0 / x) + 0.5;
}
real(8) function code(x)
real(8), intent (in) :: x
code = (1.0d0 / x) + 0.5d0
end function
public static double code(double x) {
return (1.0 / x) + 0.5;
}
def code(x): return (1.0 / x) + 0.5
function code(x) return Float64(Float64(1.0 / x) + 0.5) end
function tmp = code(x) tmp = (1.0 / x) + 0.5; end
code[x_] := N[(N[(1.0 / x), $MachinePrecision] + 0.5), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{x} + 0.5
\end{array}
Initial program 35.0%
Taylor expanded in x around 0
*-lft-identityN/A
associate-*l/N/A
distribute-rgt-inN/A
*-lft-identityN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
rgt-mult-inverseN/A
metadata-eval70.4
Simplified70.4%
(FPCore (x) :precision binary64 (/ 1.0 x))
double code(double x) {
return 1.0 / x;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0 / x
end function
public static double code(double x) {
return 1.0 / x;
}
def code(x): return 1.0 / x
function code(x) return Float64(1.0 / x) end
function tmp = code(x) tmp = 1.0 / x; end
code[x_] := N[(1.0 / x), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{x}
\end{array}
Initial program 35.0%
Taylor expanded in x around 0
/-lowering-/.f6469.6
Simplified69.6%
(FPCore (x) :precision binary64 (* x 0.08333333333333333))
double code(double x) {
return x * 0.08333333333333333;
}
real(8) function code(x)
real(8), intent (in) :: x
code = x * 0.08333333333333333d0
end function
public static double code(double x) {
return x * 0.08333333333333333;
}
def code(x): return x * 0.08333333333333333
function code(x) return Float64(x * 0.08333333333333333) end
function tmp = code(x) tmp = x * 0.08333333333333333; end
code[x_] := N[(x * 0.08333333333333333), $MachinePrecision]
\begin{array}{l}
\\
x \cdot 0.08333333333333333
\end{array}
Initial program 35.0%
Taylor expanded in x around 0
*-lft-identityN/A
associate-/l*N/A
associate-*l/N/A
+-commutativeN/A
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
associate-+l+N/A
+-commutativeN/A
distribute-lft-inN/A
associate-*r*N/A
lft-mult-inverseN/A
*-lft-identityN/A
*-commutativeN/A
associate-*l/N/A
*-lft-identityN/A
accelerator-lowering-fma.f64N/A
*-lft-identityN/A
associate-*l/N/A
distribute-rgt-inN/A
Simplified70.9%
Taylor expanded in x around inf
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
unpow3N/A
+-rgt-identityN/A
unpow3N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-eval3.5
Simplified3.5%
+-rgt-identityN/A
*-lowering-*.f643.5
Applied egg-rr3.5%
(FPCore (x) :precision binary64 0.5)
double code(double x) {
return 0.5;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 0.5d0
end function
public static double code(double x) {
return 0.5;
}
def code(x): return 0.5
function code(x) return 0.5 end
function tmp = code(x) tmp = 0.5; end
code[x_] := 0.5
\begin{array}{l}
\\
0.5
\end{array}
Initial program 35.0%
Taylor expanded in x around 0
*-lft-identityN/A
associate-*l/N/A
distribute-rgt-inN/A
*-lft-identityN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
rgt-mult-inverseN/A
metadata-eval70.4
Simplified70.4%
Taylor expanded in x around inf
Simplified3.3%
(FPCore (x) :precision binary64 (/ (- 1.0) (expm1 (- x))))
double code(double x) {
return -1.0 / expm1(-x);
}
public static double code(double x) {
return -1.0 / Math.expm1(-x);
}
def code(x): return -1.0 / math.expm1(-x)
function code(x) return Float64(Float64(-1.0) / expm1(Float64(-x))) end
code[x_] := N[((-1.0) / N[(Exp[(-x)] - 1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{-1}{\mathsf{expm1}\left(-x\right)}
\end{array}
herbie shell --seed 2024194
(FPCore (x)
:name "expq2 (section 3.11)"
:precision binary64
:pre (> 710.0 x)
:alt
(! :herbie-platform default (/ (- 1) (expm1 (- x))))
(/ (exp x) (- (exp x) 1.0)))